Difference between revisions of "2023 USAJMO"

Revision as of 12:27, 24 March 2023

Do not post these problems until after March 21 and March 22, 2023.

Day 1

Problem 1

Find all triples of positive integers $(x,y,z)$ that satisfy the equation $\begin{align*} 2(x+y+z+2xyz)^2=(2xy+2yz+2zx+1)^2+2023 \end{align*}$

Problem 2

(Holden Mui) In an acute triangle $ABC$ , let $M$ be the midpoint of $\overline{BC}$ . Let $P$ be the foot of the perpendicular from $C$ to $AM$ . Suppose that the circumcircle of triangle $ABP$ intersects line $BC$ at two distinct points $B$ and $Q$ . Let $N$ be the midpoint of $\overline{AQ}$ . Prove that $NB=NC$ .

Problem 3

(Holden Mui) Consider an $n$ -by- $n$ board of unit squares for some odd positive integer $n$ . We say that a collection $C$ of identical dominoes is a maximal grid-aligned configuration on the board if $C$ consists of $(n^2-1)/2$ dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: $C$ then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let $k(C)$ be the number of distinct maximal grid-aligned configurations obtainable from $C$ by repeatedly sliding dominoes. Find the maximum value of $k(C)$ as a function of $n$ .

Day 2

Problem 4

(David Torres) Two players, $B$ and $R$ , play the following game on an infinite grid of unit squares, all initially colored white. The players take turns starting with $B$ . On $B$ 's turn, $B$ selects one white unit square and colors it blue. On $R$ 's turn, $R$ selects two white unit squares and colors them red. The players alternate until $B$ decides to end the game. At this point, $B$ gets a score, given by the number of unit squares in the largest (in terms of area) simple polygon containing only blue unit squares. What is the largest score $B$ can guarantee?

(A simple polygon is a polygon (not necessarily convex) that does not intersect itself and has no holes.

Problem 5

A positive integer $a$ is selected, and some positive integers are written on a board. Alice and Bob play the following game. On Alice's turn, she must replace some integer $n$ on the board with $n+a$ , and on Bob's turn he must replace some even integer $n$ on the board with $n/2$ . Alice goes first and they alternate turns. If on his turn Bob has no valid moves, the game ends.

After analyzing the integers on the board, Bob realizes that, regardless of what moves Alice makes, he will be able to force the game to end eventually. Show that, in fact, for this value of $a$ and these integers on the board, the game is guaranteed to end regardless of Alice's or Bob's moves.

@@ Line 11: / Line 11: @@
 ==Problem 2==
+(''Holden Mui'') In an acute triangle <math>ABC</math>, let <math>M</math> be the midpoint of <math>\overline{BC}</math>. Let <math>P</math> be the foot of the perpendicular from <math>C</math> to <math>AM</math>. Suppose that the circumcircle of triangle <math>ABP</math> intersects line <math>BC</math> at two distinct points <math>B</math> and <math>Q</math>. Let <math>N</math> be the midpoint of <math>\overline{AQ}</math>. Prove that <math>NB=NC</math>.
 ==Problem 3==
 (''Holden Mui'') Consider an <math>n</math>-by-<math>n</math> board of unit squares for some odd positive integer <math>n</math>. We say that a collection <math>C</math> of identical dominoes is a maximal grid-aligned configuration on the board if <math>C</math> consists of <math>(n^2-1)/2</math> dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: <math>C</math> then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let <math>k(C)</math> be the number of distinct maximal grid-aligned configurations obtainable from <math>C</math> by repeatedly sliding dominoes. Find the maximum value of <math>k(C)</math> as a function of <math>n</math>.

Page

Toolbox

Search