Difference between revisions of "2022 USAMO Problems"

Revision as of 12:30, 25 March 2022

Am I allowed to post the problems yet?

Day 1

Problem 1

Let $a$ and $b$ be positive integers. The cells of an $(a+b+1)\times (a+b+1)$ grid are colored amber and bronze such that there are at least $a^2+ab-b$ amber cells and at least $b^2+ab-a$ bronze cells. Prove that it is possible to choose $a$ amber cells and $b$ bronze cells such that no two of the $a+b$ chosen cells lie in the same row or column.

Solution

Problem 2

Let $b\geq2$ and $w\geq2$ be fixed integers, and $n=b+w$ . Given are $2b$ identical black rods and $2w$ identical white rods, each of side length 1.

We assemble a regular $2n-$ gon using these rods so that parallel sides are the same color. Then, a convex $2b$ -gon $B$ is formed by translating the black rods, and a convex $2w$ -gon $W$ is formed by translating the white rods. An example of one way of doing the assembly when $b=3$ and $w=2$ is shown below, as well as the resulting polygons $B$ and $W$ .

Prove that the difference of the areas of $B$ and $W$ depends only on the numbers $b$ and $w$ , and not on how the $2n$ -gon was assembled.

Solution

Problem 3

Let $\mathbb{R}_{>0}$ be the set of all positive real numbers. Find all functions $f:\mathbb{R}_{>0} \to \mathbb{R}_{>0}$ such that for all $x,y\in \mathbb{R}_{>0}$ we have $f(x) = f(f(f(x)) + y) + f(xf(y)) f(x+y).$

Solution

Day 2

Problem 4

Find all pairs of primes $(p, q)$ for which $p-q$ and $pq-q$ are both perfect squares.

Solution

Problem 5

A function $f: \mathbb{R}\to \mathbb{R}$ is essentially increasing if $f(s)\leq f(t)$ holds whenever $s\leq t$ are real numbers such that $f(s)\neq 0$ and $f(t)\neq 0$ .

Find the smallest integer $k$ such that for any 2022 real numbers $x_1,x_2,\ldots , x_{2022},$ there exist $k$ essentially increasing functions $f_1,\ldots, f_k$ such that $f_1(n) + f_2(n) + \cdots + f_k(n) = x_n\qquad \text{for every } n= 1,2,\ldots 2022.$

Solution

Problem 6

There are 2022 users on a social network called Mathbook, and some of them are Mathbook-friends. (On Mathbook, friendship is always mutual and permanent.)

Starting now, Mathbook will only allow a new friendship to be formed between two users if they have at least two friends in common. What is the minimum number of friendships that must already exist so that every user could eventually become friends with every other user?

Solution

2022 USAMO (Problems • Resources)
Preceded by 2021 USAMO	Followed by 2023 USAMO
1 • 2 • 3 • 4 • 5 • 6
All USAMO Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.

@@ Line 3: / Line 3: @@
 ==Day 1==
 ===Problem 1===
+Let <math>a</math> and <math>b</math> be positive integers. The cells of an <math>(a+b+1)\times (a+b+1)</math> grid are colored amber and bronze such that there are at least <math>a^2+ab-b</math> amber cells and at least <math>b^2+ab-a</math> bronze cells. Prove that it is possible to choose <math>a</math> amber cells and <math>b</math> bronze cells such that no two of the <math>a+b</math> chosen cells lie in the same row or column.
 [[2022 USAMO Problems/Problem 1|Solution]]
 ===Problem 2===
+Let <math>b\geq2</math> and <math>w\geq2</math> be fixed integers, and <math>n=b+w</math>. Given are <math>2b</math> identical black rods and <math>2w</math> identical white rods, each of side length 1.
+We assemble a regular <math>2n-</math>gon using these rods so that parallel sides are the same color. Then, a convex <math>2b</math>-gon <math>B</math> is formed by translating the black rods, and a convex <math>2w</math>-gon <math>W</math> is formed by translating the white rods. An example of one way of doing the assembly when <math>b=3</math> and <math>w=2</math> is shown below, as well as the resulting polygons <math>B</math> and <math>W</math>.
+Prove that the difference of the areas of <math>B</math> and <math>W</math> depends only on the numbers <math>b</math> and <math>w</math>, and not on how the <math>2n</math>-gon was assembled.
 [[2022 USAMO Problems/Problem 2|Solution]]
 ===Problem 3===
+Let <math>\mathbb{R}_{>0}</math> be the set of all positive real numbers. Find all functions <math>f:\mathbb{R}_{>0} \to \mathbb{R}_{>0}</math> such that for all <math>x,y\in \mathbb{R}_{>0}</math> we have
+<cmath>f(x) = f(f(f(x)) + y) + f(xf(y)) f(x+y).</cmath>
 [[2022 USAMO Problems/Problem 3|Solution]]
 ==Day 2==
 ===Problem 4===
+Find all pairs of primes <math>(p, q)</math> for which <math>p-q</math> and <math>pq-q</math> are both perfect squares.
 [[2022 USAMO Problems/Problem 4|Solution]]
 ===Problem 5===
+A function <math>f: \mathbb{R}\to \mathbb{R}</math> is <i>essentially increasing</i> if <math>f(s)\leq f(t)</math> holds whenever <math>s\leq t</math> are real numbers such that <math>f(s)\neq 0</math> and <math>f(t)\neq 0</math>.
+Find the smallest integer <math>k</math> such that for any 2022 real numbers <math>x_1,x_2,\ldots , x_{2022},</math> there exist <math>k</math> essentially increasing functions <math>f_1,\ldots, f_k</math> such that<cmath>f_1(n) + f_2(n) + \cdots + f_k(n) = x_n\qquad \text{for every } n= 1,2,\ldots 2022.</cmath>
 [[2022 USAMO Problems/Problem 5|Solution]]
 ===Problem 6===
+There are 2022 users on a social network called Mathbook, and some of them are Mathbook-friends. (On Mathbook, friendship is always mutual and permanent.)
+Starting now, Mathbook will only allow a new friendship to be formed between two users if they have <i>at least two</i> friends in common. What is the minimum number of friendships that must already exist so that every user could eventually become friends with every other user?
 [[2022 USAMO Problems/Problem 6|Solution]]
 {{USAMO newbox|year= 2022 |before=[[2021 USAMO]]|after=[[2023 USAMO]]}}
 {{MAA Notice}}

Page

Toolbox

Search

Difference between revisions of "2022 USAMO Problems"

Revision as of 12:30, 25 March 2022

Contents

Day 1

Problem 1

Problem 2

Problem 3

Day 2

Problem 4

Problem 5

Problem 6