Documents

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

Let Z\mathbb{Z} be the set of integers. Determine all functions f:ZZf: \mathbb{Z} \to \mathbb{Z} such that, for all integers aa and bb, f(2a)+2f(b)=f(f(a+b)).f(2a) + 2f(b) = f(f(a + b)).

Problem 2

In triangle ABCABC, point A1A_1 lies on side BCBC and point B1B_1 lies on side ACAC. Let PP and QQ be points on segments AA1AA_1 and BB1BB_1, respectively, such that PQPQ is parallel to ABAB. Let P1P_1 be a point on line PB1PB_1, such that B1B_1 lies strictly between PP and P1P_1, and PP1C=BAC\angle PP_1C = \angle BAC. Similarly, let Q1Q_1 be a point on line QA1QA_1, such that A1A_1 lies strictly between QQ and Q1Q_1, and CQ1Q=CBA\angle CQ_1Q = \angle CBA.

Prove that points PP, QQ, P1P_1, and Q1Q_1 are concyclic.

Problem 3

A social network has 2019 users, some pairs of whom are friends. Whenever user AA is friends with user BB, user BB is also friends with user AA. Events of the following kind may happen repeatedly, one at a time:

Three users AA, BB, and CC such that AA is friends with both BB and CC, but BB and CC are not friends, change their friendship statuses such that BB and CC are now friends, but AA is no longer friends with BB, and no longer friends with CC. All other friendship statuses are unchanged.

Initially, 1010 users have 1009 friends each, and 1009 users have 1010 friends each. Prove that there exists a sequence of such events after which each user is friends with at most one other user.

Problem 4

Find all pairs (k,n)(k, n) of positive integers such that k!=(2n1)(2n2)(2n4)(2n2n1).k! = (2^n - 1)(2^n - 2)(2^n - 4) \cdots (2^n - 2^{n-1}).

Problem 5

The Bank of Bath issues coins with an HH on one side and a TT on the other. Harry has nn of these coins arranged in a line from left to right. He repeatedly performs the following operation: if there are exactly k>0k > 0 coins showing HH, then he turns over the kkth coin from the left; otherwise, all coins show TT and he stops. For example, if n=3n = 3 the process starting with the configuration THTTHT would be THTHHTHTTTTTTHT \to HHT \to HTT \to TTT, which stops after three operations.

(a) Show that, for each initial configuration, Harry stops after a finite number of operations.

(b) For each initial configuration CC, let L(C)L(C) be the number of operations before Harry stops. For example, L(THT)=3L(THT) = 3 and L(TTT)=0L(TTT) = 0. Determine the average value of L(C)L(C) over all 2n2^n possible initial configurations CC.

Problem 6

Let II be the incentre of acute triangle ABCABC with ABACAB \neq AC. The incircle ω\omega of ABCABC is tangent to sides BCBC, CACA, and ABAB at DD, EE, and FF, respectively. The line through DD perpendicular to EFEF meets ω\omega again at RR. Line ARAR meets ω\omega again at PP. The circumcircles of triangles PCEPCE and PBFPBF meet again at QQ.

Prove that lines DIDI and PQPQ meet on the line through AA perpendicular to AIAI.