2023 USAMO Problems

Revision as of 19:48, 2 April 2023 by Blehlivesonearth (talk | contribs) (Created page with "==Day 1== ===Problem 1=== 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 perpen...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 the maximum value of $k(C)$ as a function of $n$.

Solution

Day 2

Problem 4

Solution

Problem 5

Solution

Problem 6

Solution

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