Documents

YearFilenameLanguageSource
2023IMO-2023-problems-eng.pdfen
Problem 1

Determine all composite integers n>1n > 1 that satisfy the following property: if d1,d2,,dkd_1, d_2, \ldots, d_k are all the positive divisors of nn with 1=d1<d2<<dk=n1 = d_1 < d_2 < \cdots < d_k = n, then did_i divides di+1+di+2d_{i+1} + d_{i+2} for every 1ik21 \leqslant i \leqslant k-2.

Problem 2

Let ABCABC be an acute-angled triangle with AB<ACAB < AC. Let Ω\Omega be the circumcircle of ABCABC. Let SS be the midpoint of the arc CBCB of Ω\Omega containing AA. The perpendicular from AA to BCBC meets BSBS at DD and meets Ω\Omega again at EAE \neq A. The line through DD parallel to BCBC meets line BEBE at LL. Denote the circumcircle of triangle BDLBDL by ω\omega. Let ω\omega meet Ω\Omega again at PBP \neq B. Prove that the line tangent to ω\omega at PP meets line BSBS on the internal angle bisector of BAC\measuredangle BAC.

Problem 3

For each integer k2k \geqslant 2, determine all infinite sequences of positive integers a1,a2,a_1, a_2, \ldots for which there exists a polynomial PP of the form P(x)=xk+ck1xk1++c1x+c0P(x) = x^k + c_{k-1}x^{k-1} + \cdots + c_1x + c_0, where c0,c1,,ck1c_0, c_1, \ldots, c_{k-1} are non-negative integers, such that

P(an)=an+1an+2an+kP(a_n) = a_{n+1}a_{n+2}\cdots a_{n+k}

for every integer n1n \geqslant 1.

Problem 4

Let x1,x2,,x2023x_1, x_2, \ldots, x_{2023} be pairwise different positive real numbers such that

an=(x1+x2++xn)(1x1+1x2++1xn)a_n = \sqrt{(x_1 + x_2 + \cdots + x_n)\left(\frac{1}{x_1} + \frac{1}{x_2} + \cdots + \frac{1}{x_n}\right)}

is an integer for every n=1,2,,2023n = 1, 2, \ldots, 2023. Prove that a20233034a_{2023} \geqslant 3034.

Problem 5

Let nn be a positive integer. A Japanese triangle consists of 1+2++n1 + 2 + \cdots + n circles arranged in an equilateral triangular shape such that for each i=1,2,,ni = 1, 2, \ldots, n, the ithi^{\text{th}} row contains exactly ii circles, exactly one of which is coloured red. A ninja path in a Japanese triangle is a sequence of nn circles obtained by starting in the top row, then repeatedly going from a circle to one of the two circles immediately below it and finishing in the bottom row. Here is an example of a Japanese triangle with n=6n = 6, along with a ninja path in that triangle containing two red circles.

figure

In terms of nn, find the greatest kk such that in each Japanese triangle there is a ninja path containing at least kk red circles.

Problem 6

Let ABCABC be an equilateral triangle. Let A1,B1,C1A_1, B_1, C_1 be interior points of ABCABC such that BA1=A1CBA_1 = A_1C, CB1=B1ACB_1 = B_1A, AC1=C1BAC_1 = C_1B, and

BA1C+CB1A+AC1B=480°.\angle BA_1C + \angle CB_1A + \angle AC_1B = 480°.

Let BC1BC_1 and CB1CB_1 meet at A2A_2, let CA1CA_1 and AC1AC_1 meet at B2B_2, and let AB1AB_1 and BA1BA_1 meet at C2C_2. Prove that if triangle A1B1C1A_1B_1C_1 is scalene, then the three circumcircles of triangles AA1A2AA_1A_2, BB1B2BB_1B_2 and CC1C2CC_1C_2 all pass through two common points.

(Note: a scalene triangle is one where no two sides have equal length.)