olymmath

ELMO 2019

ELMO 2019.

Official paper

The official paper in 1 language

English

Other problems

Problem 1

Let P(x)P(x) be a polynomial with integer coefficients such that P(0)=1P(0)=1 , and let c>1c > 1 be an integer. Define x0=0x_0=0 and xi+1=P(xi)x_{i+1} = P(x_i) for all integers i≥0i \ge 0 . Show that there are infinitely many positive integers nn such that gcd⁡(xn,n+c)=1\gcd (x_n, n+c)=1 .

Proposed by Milan Haiman and Carl Schildkraut

Problem 2

Let m,n≥2m, n \ge 2 be integers. Carl is given nn marked points in the plane and wishes to mark their centroid.* He has no standard compass or straightedge. Instead, he has a device which, given marked points AA and BB , marks the m−1m-1 points that divide segment AB‾\overline{AB} into mm congruent parts (but does not draw the segment).

For which pairs (m,n)(m,n) can Carl necessarily accomplish his task, regardless of which nn points he is given?

*Here, the centroid of nn points with coordinates (x1,y1),…,(xn,yn)(x_1, y_1), \dots, (x_n, y_n) is the point with coordinates (x1+⋯+xnn,y1+⋯+ynn)\left( \frac{x_1 + \dots + x_n}{n}, \frac{y_1 + \dots + y_n}{n}\right) .

Proposed by Holden Mui and Carl Schildkraut

Problem 3

Let n≥3n \ge 3 be a fixed integer. A game is played by nn players sitting in a circle. Initially, each player draws three cards from a shuffled deck of 3n3n cards numbered 1,2,…,3n1, 2, \dots, 3n . Then, on each turn, every player simultaneously passes the smallest-numbered card in their hand one place clockwise and the largest-numbered card in their hand one place counterclockwise, while keeping the middle card.

Let TrT_r denote the configuration after rr turns (so T0T_0 is the initial configuration). Show that TrT_r is eventually periodic with period nn , and find the smallest integer mm for which, regardless of the initial configuration, Tm=Tm+nT_m=T_{m+n} .

Proposed by Carl Schildkraut and Colin Tang

Problem 4

Carl is given three distinct non-parallel lines ℓ1,ℓ2,ℓ3\ell_1, \ell_2, \ell_3 and a circle ω\omega in the plane. In addition to a normal straightedge, Carl has a special straightedge which, given a line ℓ\ell and a point PP , constructs a new line passing through PP parallel to ℓ\ell . (Carl does not have a compass.) Show that Carl can construct a triangle with circumcircle ω\omega whose sides are parallel to ℓ1,ℓ2,ℓ3\ell_1,\ell_2,\ell_3 in some order.

Proposed by Vincent Huang

Problem 5

Let SS be a nonempty set of positive integers such that, for any (not necessarily distinct) integers aa and bb in SS , the number ab+1ab+1 is also in SS . Show that the set of primes that do not divide any element of SS is finite.

Proposed by Carl Schildkraut

Problem 6

Carl chooses a functional expression* EE which is a finite nonempty string formed from a set x1,x2,…x_1, x_2, \dots of variables and applications of a function ff , together with addition, subtraction, multiplication (but not division), and fixed real constants. He then considers the equation E=0E = 0 , and lets SS denote the set of functions f ⁣:R→Rf \colon \mathbb R \to \mathbb R such that the equation holds for any choices of real numbers x1,x2,…x_1, x_2, \dots . (For example, if Carl chooses the functional equation f(2f(x1)+x2)−2f(x1)−x2=0,f(2f(x_1)+x_2) - 2f(x_1)-x_2 = 0, then SS consists of one function, the identity function.

(a) Let XX denote the set of functions with domain R\mathbb R and image exactly Z\mathbb Z . Show that Carl can choose his functional equation such that SS is nonempty but S⊆XS \subseteq X .

(b) Can Carl choose his functional equation such that ∣S∣=1|S|=1 and S⊆XS \subseteq X ?

*These can be defined formally in the following way: the set of functional expressions is the minimal one (by inclusion) such that (i) any fixed real constant is a functional expression, (ii) for any positive integer ii , the variable xix_i is a functional expression, and (iii) if VV and WW are functional expressions, then so are f(V)f(V) , V+WV+W , V−WV-W , and V⋅WV \cdot W .

Proposed by Carl Schildkraut