22/07/2019 IMO 2019

IMO 2019

Q1.
f (2a) + 2f (b) = f (f (a + b))
f :Z→Z

f (2a) − 2f (a) = f (2b) − 2f (b) = const.

Let −c be the const

c = f (0)
3c = f (c)
5c = f (2c)
(1 + 2k+1 )c = f (2k c)
(1 − 2k+1 )c = f (−2k c)
Let a = −b
2f (a) + 2f (−a) − f (0) = f (c)

2f (a) + f (0) = f (2f (a) − f (0))

Case: f zero everywhere. Yay.

Case: c =0
let x be such that f (x) 0
=

f (f (x)) = 2f (x) + f (0)

2f (a) + 2f (b) − f (0) = 2f (a + b) + f (0)
Let g(x) = f (x) − f (0)

g(a) + g(b) = g(a + b)

Which we can do an induc on to show that g(x) = rx for some integer a

f (x) = rx + c

2ar + 2br + 3c = (r(a + b) + c)r + c

r = 2 or c = r = 0
Both of these work.

Q2
Let X and Y be the intersec on of QP with CB and CA respec vely.

We know P P1 Y C and QQ1 XB are cyclic quadrilaterals by angle chase.

file:///Users/alexandersamuelgunning/Downloads/IMO 2019 (1).html 1/5
22/07/2019 IMO 2019

Let Z be the intersec on of their circumcircles. Then by radical axis theorem it STP that
P P1 , QQ1 and CZ concur.

Let S be the intersec on of CZ and P Q. We know by 2 applica ons of power of a point that
SP × SY = SC × SZ = SQ × SZ and that it STP SC , A1 Q and B1 P are concurrent,
a purely affine condi on.

Let T be the intersec on of CS with AB , and D, E be the intersec ons of A1 Q, B1 P with

AB .
We used directed lengths in all of the below
P S/QS = XS/Y S = P X/QY

AE/BD = (AE/AB) ∗ (AB/BD) = (P Q/P X) ∗ (QY /P Q) = QY /P X =

Y S/XS because dila on from A1 and B1
This is also = BT /AT because dila on from C
(AT + T E)/(BT + T D) = BT /AT = T E/T D = Y S/XS = QS/P S
So we are done by similar triangles (dila on from intersec on of QE and P D )

Q3.
Notes:
-Parity of number of friends is conserved for each individual, we will use “odd ver ces” and
“even ver ces” sensibly from now on.

-We are only stuck when the graph is a disjoint union of cliques

-At the end, each of the 1010 users must have exactly 1 friend

-The set of friendships collapsed into a friendship A->B is a path at any point, we want to
par on the graph into 505 paths, but this is not sufficient (it’s unclear whether at any point
we will be able to collapse a path.) (Here we assume paths can visit a vertex mul ple mes.)

-The graph is connected bc any par oning of it into 2 pieces must have a component of
<=1009 people

-So you can par on it into 505 paths by basically the same argument as showing the
existence of Euler circuits

-If we ghten and assume each path must visit each vertex <=1nce (and I think exactly once),
is this enough? I don’t see how

-Really dumb condi on we hope we can preserve: there are no ccs (connected component)
build en rely out of even ver ces and no ccs that are cliques of size >= 2

file:///Users/alexandersamuelgunning/Downloads/IMO 2019 (1).html 2/5

22/07/2019 IMO 2019

-Let X, Y , Z be the relevant users; suppose replacing X − Y − Z with X − Z creates a

bad cc.

-Suppose removing Y creates a bunch of ccs C1 , C2 , ...Cm .

-Case: One connected component. Then adding XZ to C1 creates a clique of odd ver ces of
size >= 4, let W be in this clique and not connected to Y and reduce W XY

-Case: At least 2 ccs, and say C1 is connected to Y by at least 2 edges. Then let X in C1
have XY an edge, Z in C2 have ZY an edge and reduce XY Z . No new connected
components are created.

-Case: At least 2 ccs, and all of them are connected to Y by exactly one edge. Then all of
them must contain an odd vertex. Reducing XY Z where X and Z are in different connected
components will split the graph into 2 connected components, but all of them will contain at
least one odd vertex and none of them can be cliques of size >= 4

So doing this induc vely, we find that the graph is never a disjoint union of cliques of size >
= 3, and so we can always collapse some edges XY , Y Z into Y Z . There will be no
connected components en rely with even ver ces, and no connected component cliques of
size >= 4

Q4.

Note that the number of powers of 2 that divide the LHS is (n − 1)n/2, and LHS is bounded
2
above by 2n −1

So 2j ∣LHS where say 23j > LHS [n > 2]

Number of powers of 2 that divide the RHS is bounded above by k −1

k! ≥ (k/e)k (S rling’s approxima on)
so this is strong for k > 8e ≃ 24
n=1→1→k=1
n=2→3∗2→k =3
n = 3 → 7 ∗ 6 ∗ 4 = 24 ∗ 7 = 168 no.
n = 4 → 15 ∗ 14 ∗ 12 ∗ 8 = 180 ∗ 8 ∗ 14 = 2520 ∗ 8 = 20160 no. (almost!)
n ≥ 5 means that 31∣2n − 2n−5 ∣k! which is kind of bad, given that k ≤ 24

Actually a group theory ques on (can Sk and SLn (F2 ) be the same group?)

Q5
No ce that

file:///Users/alexandersamuelgunning/Downloads/IMO 2019 (1).html 3/5

22/07/2019 IMO 2019

-the last coin which is heads is weakly decreasing

-Suppose we have ??????HT T T . Then,

-The final H is only switched when the sequence is HHHHHHT T T . In this case all n
heads are then flipped in sequence from last to first

-The algorithm you perform on ???HTTT is that the j th coin from the end in the sequence of
???s is flipped, where j is the number of tails among the ???S (if the number of ???is of length
n, then there are n − j + 1 heads, and the n − j + 1th coin is the j th coing from the end.
So if we reverse the sequence in the ??? and change all the heads to tails, then we get a
problem that’s isomorphic to the original problem.

-Let an be the average number of flips required. (note a0 = 0). We compute an+1 .

-If the last coin is T , it takes an , on average. If the last coin is H , it takes on average an flips
n+1
to get to HHHH..HH by the above, and then it takes n + 1 flips. So an+1 = an + 2

n(n+1)
-By induc on, an = 4
Q6

Let D ′ be the point diametrically opposite D on ω , and let J be the intersec on of ω with
the circumcircle of AID

Let t be the transforma on consis ng of an inversion about a circle of radius AE about A,

and then a reflec on about AI . ω is orthogonal to AI , so is preserved by this

P is sent to R by the inversion, and is sent to D′ by the reflec on (we show by angle chase).
As IJ = ID , ∠DAI = ∠IAJ , so D and I swap places.

Let G be the intersec on of P J and DD ′ = DI . Note P J does not pass through I , so G

does not lie on AI [ also necessary to check P J, DI not parallel]xs. Then t(G) lies on the
circumcircles of AP J and ADD ′ . By the radical axis theorem, t(G)A, P J and DD ′
concur, that is t(G)AG are collinear. But ∠t(G)AI = ∠IAG, so G lies on the external
angle bisector of ∠BAC

So STP P QJ collinear.

Let J ′ be the other intersec on of P Q with ω

CQ∣∣J ′ E and also J ′ F ∣∣BQ because angles

file:///Users/alexandersamuelgunning/Downloads/IMO 2019 (1).html 4/5

22/07/2019 IMO 2019

using transla on, we have that J ′ Q and EC form 2 sides of a triangle with angles ∠EJ ′ Q
and ∠J ′ EC . and symmetrically. So

EC/F B = (EC/J ′ Q) ∗ (J ′ Q/F B) = (sin ∠EJ ′ P )/(sin ∠J ′ EA) ∗

(sin ∠P J ′ F ) ∗ (sin ∠J ′ F A) = EP /J ′ E ∗ J ′ F /F P = ER/F R ∗ J ′ F /E ′ J . Note
that ERF P are harmonic.

J ′ F /E ′ J = EC/F B ∗ F R/ER = ED/F D ∗ (sin ∠IBF / sin ∠ICE) ∗

(sin ∠RDF / sin ∠RDE)
but ∠RDF = ∠ICE and ∠RDE = ∠IBD because angle chasing. So

J ′ F /EJ ′ = ED/F D = F J/JE .

So EJF ≃ EJ ′ F and J = J ′ . QED.

(Note that we can show that ED ∗ JE = F D ∗ JF from the similar triangles AJF ∼
AED; AJE ∼ AF E )

file:///Users/alexandersamuelgunning/Downloads/IMO 2019 (1).html 5/5