olymmath

USAJMO 2021

United States of America Junior Mathematical Olympiad 2021.

Day 1

Problem 1

  • Day 1

Let N\mathbb{N} denote the set of positive integers. Find all functions f:N→Nf : \mathbb{N} \rightarrow \mathbb{N} such that for positive integers aa and b,b, f(a2+b2)=f(a)f(b) and f(a2)=f(a)2.f(a^2 + b^2) = f(a)f(b) \text{ and } f(a^2) = f(a)^2.

Answer, solutions and source

Problem 2 · Also USAMO 2021 Problem 1

  • Day 1

Rectangles BCC1B2,BCC_1B_2, CAA1C2,CAA_1C_2, and ABB1A2ABB_1A_2 are erected outside an acute triangle ABC.ABC. Suppose that ∠BC1C+∠CA1A+∠AB1B=180∘.\angle BC_1C+\angle CA_1A+\angle AB_1B=180^{\circ}. Prove that lines B1C2,B_1C_2, C1A2,C_1A_2, and A1B2A_1B_2 are concurrent.

Answer, solutions and source

Problem 3

  • Day 1

An equilateral triangle Δ\Delta of side length L>0L>0 is given. Suppose that nn equilateral triangles with side length 1 and with non-overlapping interiors are drawn inside Δ\Delta , such that each unit equilateral triangle has sides parallel to Δ\Delta , but with opposite orientation. (An example with n=2n=2 is drawn below.) [asy] draw((0,0)--(1,0)--(1/2,sqrt(3)/2)--cycle,linewidth(0.5)); filldraw((0.45,0.55)--(0.65,0.55)--(0.55,0.55-sqrt(3)/20.2)--cycle,gray,linewidth(0.5)); filldraw((0.54,0.3)--(0.34,0.3)--(0.44,0.3-sqrt(3)/20.2)--cycle,gray,linewidth(0.5)); [/asy] Prove that n≤23L2.n \leq \frac{2}{3} L^{2}.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Carina has three pins, labeled A,BA, B , and CC , respectively, located at the origin of the coordinate plane. In a move, Carina may move a pin to an adjacent lattice point at distance 11 away. What is the least number of moves that Carina can make in order for triangle ABCABC to have area 2021?

(A lattice point is a point (x,y)(x, y) in the coordinate plane where xx and yy are both integers, not necessarily positive.)

Answer, solutions and source

Problem 5 · Also USAMO 2021 Problem 4

  • Day 2

A finite set SS of positive integers has the property that, for each s∈S,s \in S, and each positive integer divisor dd of ss , there exists a unique element t∈St \in S satisfying gcd(s,t)=d\text{gcd}(s, t) = d . (The elements ss and tt could be equal.)

Given this information, find all possible values for the number of elements of SS .

Answer, solutions and source

Problem 6 · Also USAMO 2021 Problem 5

  • Day 2

Let n≥4n \geq 4 be an integer. Find all positive real solutions to the following system of 2n2n equations:

\begin{align*} a_{1} &=\frac{1}{a_{2 n}}+\frac{1}{a_{2}}, & a_{2}&=a_{1}+a_{3}, a_{3}&=\frac{1}{a_{2}}+\frac{1}{a_{4}}, & a_{4}&=a_{3}+a_{5}, a_{5}&=\frac{1}{a_{4}}+\frac{1}{a_{6}}, & a_{6}&=a_{5}+a_{7} &\vdots & &\vdots a_{2 n-1}&=\frac{1}{a_{2 n-2}}+\frac{1}{a_{2 n}}, & a_{2 n}&=a_{2 n-1}+a_{1} \end{align*}

Answer, solutions and source