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 "2023 USAMO Problems"

m (newbox)
(→‎Problem 3)
Line 12: Line 12:
  
 
===Problem 3===
 
===Problem 3===
−
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>.
+
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 all possible values of <math>k(C)</math> as a function of <math>n</math>.
  
 
[[2023 USAMO Problems/Problem 3|Solution]]
 
[[2023 USAMO Problems/Problem 3|Solution]]

Revision as of 14:16, 2 March 2024

Day 1

Problem 1

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

Solution

Problem 2

Let $\mathbb{R}^{+}$ be the set of positive real numbers. Find all functions $f:\mathbb{R}^{+}\rightarrow\mathbb{R}^{+}$ such that, for all $x, y \in \mathbb{R}^{+}$, \[f(xy + f(x)) = xf(y) + 2\]

Solution

Problem 3

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 all possible values of $k(C)$ as a function of $n$.

Solution

Day 2

Problem 4

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.

Solution

Problem 5

Let $n\geq3$ be an integer. We say that an arrangement of the numbers $1$, $2$, $\dots$, $n^2$ in a $n \times n$ table is row-valid if the numbers in each row can be permuted to form an arithmetic progression, and column-valid if the numbers in each column can be permuted to form an arithmetic progression. For what values of $n$ is it possible to transform any row-valid arrangement into a column-valid arrangement by permuting the numbers in each row?

Solution

Problem 6

Let ABC be a triangle with incenter $I$ and excenters $I_a$, $I_b$, $I_c$ opposite $A$, $B$, and $C$, respectively. Given an arbitrary point $D$ on the circumcircle of $\triangle ABC$ that does not lie on any of the lines $IIa$, $I_bI_c$, or $BC$, suppose the circumcircles of $\triangle DIIa$ and $\triangle DI_bI_c$ intersect at two distinct points $D$ and $F$. If $E$ is the intersection of lines $DF$ and $BC$, prove that $\angle BAD = \angle EAC$.

Solution

See Also

2023 USAMO (Problems • Resources)
Preceded by
2022 USAMO Problems 		Followed by
2024 USAMO Problems
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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2023_USAMO_Problems&oldid=216386"