Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2022 USAJMO Problems"

(→‎Problem 3)
(→‎Problem 1)
Line 2: Line 2:
 
<math>\textbf{Note:}</math> For any geometry problem whose statement begins with an asterisk <math>(*)</math>, the first page of the solution must be a large, in-scale, clearly labeled diagram. Failure to meet this requirement will result in an automatic 1-point deduction.
 
<math>\textbf{Note:}</math> For any geometry problem whose statement begins with an asterisk <math>(*)</math>, the first page of the solution must be a large, in-scale, clearly labeled diagram. Failure to meet this requirement will result in an automatic 1-point deduction.
 
===Problem 1===
 
===Problem 1===
−
For which positive integers <math>m</math> does there exist an infinite arithmetic sequence of integers <math>a_1,a_2,\cdots</math> and an infinite geometric sequence of integers <math>g_1,g_2,\cdots</math> satisfying the following properties?
+
For which positive integers <math>m</math> does there exist an infinite arithmetic sequence of integers <math>a_1,a_2,\cdots</math> and an infinite geometric
  
−
<math>\bullet</math> <math>a_n-g_n</math> is divisible by <math>m</math> for all integers <math>n>1</math>;
 
−
 
−
<math>\bullet</math> <math>a_2-a_1</math> is not divisible by <math>m</math>.
 
−
 
−
[[2022 USAJMO Problems/Problem 1|Solution]]
 
 
===Problem 2===
 
===Problem 2===
 
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.
 
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.

Revision as of 14:17, 11 February 2023

Day 1

$\textbf{Note:}$ For any geometry problem whose statement begins with an asterisk $(*)$, the first page of the solution must be a large, in-scale, clearly labeled diagram. Failure to meet this requirement will result in an automatic 1-point deduction.

Problem 1

For which positive integers $m$ does there exist an infinite arithmetic sequence of integers $a_1,a_2,\cdots$ and an infinite geometric

Problem 2

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 3

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$.

[asy] size(10cm); real w = 2*Sin(18); real h = 0.10 * w; real d = 0.33 * h; picture wht; picture blk; draw(wht, (0,0)--(w,0)--(w+d,h)--(-d,h)--cycle); fill(blk, (0,0)--(w,0)--(w+d,h)--(-d,h)--cycle, black); // draw(unitcircle, blue+dotted); // Original polygon add(shift(dir(108))*blk); add(shift(dir(72))*rotate(324)*blk); add(shift(dir(36))*rotate(288)*wht); add(shift(dir(0))*rotate(252)*blk); add(shift(dir(324))*rotate(216)*wht); add(shift(dir(288))*rotate(180)*blk); add(shift(dir(252))*rotate(144)*blk); add(shift(dir(216))*rotate(108)*wht); add(shift(dir(180))*rotate(72)*blk); add(shift(dir(144))*rotate(36)*wht); // White shifted real Wk = 1.2; pair W1 = (1.8,0.1); pair W2 = W1 + w*dir(36); pair W3 = W2 + w*dir(108); pair W4 = W3 + w*dir(216); path Wgon = W1--W2--W3--W4--cycle; draw(Wgon); pair WO = (W1+W3)/2; transform Wt = shift(WO)*scale(Wk)*shift(-WO); draw(Wt * Wgon); label("$W$", WO); /* draw(W1--Wt*W1); draw(W2--Wt*W2); draw(W3--Wt*W3); draw(W4--Wt*W4); */ // Black shifted real Bk = 1.10; pair B1 = (1.5,-0.1); pair B2 = B1 + w*dir(0); pair B3 = B2 + w*dir(324); pair B4 = B3 + w*dir(252); pair B5 = B4 + w*dir(180); pair B6 = B5 + w*dir(144); path Bgon = B1--B2--B3--B4--B5--B6--cycle; pair BO = (B1+B4)/2; transform Bt = shift(BO)*scale(Bk)*shift(-BO); fill(Bt * Bgon, black); fill(Bgon, white); label("$B$", BO); [/asy]

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

Day 2

Problem 4

$(*)$ Let $ABCD$ be a rhombus, and let $K$ and $L$ be points such that $K$ lies inside the rhombus, $L$ lies outside the rhombus, and $KA=KB=LC=LD$. Prove that there exist points $X$ and $Y$ on lines $AC$ and $BD$ such that $KXLY$ is also a rhombus.

Solution

Problem 5

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

Solution

Problem 6

Let $a_0,b_0,c_0$ be complex numbers, and define

\[a_{n+1}=a_n^2+2b_nc_n\] \[b_{n+1}=b_n^2+2c_na_n\] \[c_{n+1}=c_n^2+2a_nb_n\] for all nonnegative integers $n$.

Suppose that $\max{(|a_n|,|b_n|,|c_n|)}\leq2022$ for all $n$. Prove that \[|a_0|^2+|b_0|^2+|c_0|^2\leq 1.\] Solution

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

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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2022_USAJMO_Problems&oldid=189508"