olymmath

IMO 2019

International Mathematical Olympiad 2019.

Official paper

The official paper in 58 languages

English · Afrikaans · Albanian · Albanian (Kosovo) · Arabic · Arabic (Algerian) · Armenian · Arabic (Moroccan) · Arabic (Syrian) · Arabic (Tunisian) · Arabic (UAE) · Azerbaijani · Bosnian · Bulgarian · Chinese (Simplified) · Chinese (Traditional) · Czech · Danish · Dutch · Estonian · Finnish · French · Georgian · German · Hebrew · Greek · Croatian · Hungarian · Icelandic · Indonesian · Italian · Japanese · Khmer · Korean · Korean (North Korea) · Latvian · Lithuanian · Macedonian · Montenegrin · Mongolian · Norwegian · Persian (Farsi) · Polish · Portuguese · Romanian · Russian · Slovak · Slovenian · Spanish · Serbian (BIH) · Serbian · Swedish · Thai · Turkmen · Turkish · Ukrainian · Uzbek · Vietnamese

Day 1

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 the 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 P,Q,P1P,Q,P_1 , and Q1Q_1 are concyclic.

Proposed by Anton Trygub, Ukraine

Answer, solutions and source

Problem 3

A social network has 20192019 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, 10101010 users have 10091009 friends each, and 10091009 users have 10101010 friends each. Prove that there exists a sequence of such events after which each user is friends with at most one other user.

Proposed by Adrian Beker, Croatia

Answer, solutions and source

Day 2

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 kk th 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 THT→HHT→HTT→TTTTHT \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 .

Proposed by David Altizio, USA

Answer, solutions and source

Problem 6

Let II be the incentre of acute triangle ABCABC with AB≠ACAB\neq AC . The incircle ω\omega of ABCABC is tangent to sides BC,CABC, CA , and ABAB at D,E,D, E, and FF , respectively. The line through DD perpendicular to EFEF meets ω\omega at RR . Line ARAR meets ω\omega again at PP . The circumcircles of triangle PCEPCE and PBFPBF meet again at QQ .

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

Proposed by Anant Mudgal, India

Answer, solutions and source