olymmath

US-TST 2024

USA IMO Team Selection Test 2024.

Other problems

Problem 1

Find the smallest constant C>1C > 1 such that the following statement holds: for every integer n≥2n\geq 2 and sequence of non-integer positive real numbers a1a_{1} , a2a_{2} , ..., ana_{n} satisfying

1a1+1a2+⋯+1an=1,\frac{1}{a_{1}} +\frac{1}{a_{2}} +\dots +\frac{1}{a_{n}} = 1,

it's possible to choose positive integers bib_{i} such that

(i) for each i=1,2,…,ni = 1,2,\ldots ,n , either bi=⌊ai⌋b_{i} = \lfloor a_{i}\rfloor or bi=⌊ai⌋+1b_{i} = \lfloor a_{i}\rfloor +1 ; and

(ii) we have

1<1b1+1b2+⋯+1bn≤C.1< \frac{1}{b_{1}} +\frac{1}{b_{2}} +\dots +\frac{1}{b_{n}}\leq C.

Problem 2

Let ABCA B C be a triangle with incenter II . Let segment AIA I intersect the incircle of triangle ABCA B C at point DD . Suppose that line BDB D is perpendicular to line ACA C . Let PP be a point such that ∠BPA=∠PAI=90∘\angle B P A = \angle P A I = 90^{\circ} . Point QQ lies on segment BDB D such that the circumcircle of triangle ABQA B Q is tangent to line BIB I . Point XX lies on line PQP Q such that ∠IAX=∠XAC\angle I A X = \angle X A C . Prove that ∠AXP=45∘\angle A X P = 45^{\circ} .

Problem 3

Let n>k≥1n > k\geq 1 be integers and let pp be a prime dividing (nk){\binom{n}{k}} . Prove that the kk -element subsets of {1,…,n}\{1,\ldots ,n\} can be split into pp classes of equal size, such that any two subsets with the same sum of elements belong to the same class.

Problem 4

Find all integers n≥2n\geq 2 for which there exists a sequence of 2n2n pairwise distinct points (P1,…,Pn,Q1,…,Qn)(P_{1},\ldots ,P_{n},Q_{1},\ldots ,Q_{n}) in the plane satisfying the following four conditions:

(i) no three of the 2n2n points are collinear;

(ii) PiPi+1≥1P_{i}P_{i + 1}\geq 1 for all i=1,2,…,ni = 1,2,\ldots ,n , where Pn+1=P1P_{n + 1} = P_{1}

(iii) QiQi+1≥1Q_{i}Q_{i + 1}\geq 1 for all i=1,2,…,ni = 1,2,\ldots ,n , where Qn+1=Q1Q_{n + 1} = Q_{1} ; and

(iv) PiQj≤1P_{i}Q_{j}\leq 1 for all i=1,2,…,ni = 1,2,\ldots ,n and j=1,2,…,nj = 1,2,\ldots ,n

Problem 5

Suppose a1<a2<⋯<a2024a_{1}< a_{2}< \dots < a_{2024} is an arithmetic sequence of positive integers, and b1<b2<⋯<b2024b_{1}< b_{2}< \dots < b_{2024} is a geometric sequence of positive integers. Find the maximum possible number of integers that could appear in both sequences, over all possible choices of the two sequences.

Problem 6

Solve over R\mathbb{R} the functional equation

f(xf(y))+f(y)=f(x+y)+f(xy).f(x f(y)) + f(y) = f(x + y) + f(x y).