2022 USAJMO Problems

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 sequence of integers $g_1,g_2,\cdots$ satisfying the following properties?

$\bullet$ $a_n-g_n$ is divisible by $m$ for all integers $n>1$ ;

$\bullet$ $a_2-a_1$ is not divisible by $m$ .

Solution

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

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

[image here]

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.

Day 2

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.

Page

Toolbox

Search

2022 USAJMO Problems

Contents

Day 1

Problem 1

Problem 2

Problem 3

Day 2

Problem 4

Problem 5

Problem 6