APril fools’ Math Olympiad Year: 2020

1st APMO Day: 2

Wherever

Wednesday, April 1, 2020

Whenever

Problem 4. In some country, there are 2020 cities. Two politicians, Andrew and Bndrew,
take turns creating one-way roads between the towns, with Andrew going first (a road can
connect a town to itself if the politicians are feeling especially political). On each turn, a
politician may create exactly one road; however, no town can have multiple roads entering
it or multiple roads exiting it. Once no more roads can be made, the cities begin to trade
with each other, with trade occurring only along the roads (so two cities can trade with
each other if and only if there is a sequence of roads going from the first city to the second).
Eventually, the cities split into separate nation-states so that cities that trade with each
other end up in the same nation-state, but cities that could not trade with each other end
up in different nation-states. Andrew wins if there are an even number of nation-states,
while Bndrew wins otherwise. Assuming both players play optimally, will Bndrew win?

Problem 5. Finitely many circles reside in the plane. A pair of circles (Γ, γ) is said to be
scribable if there exists a triangle with circumcircle Γ and incircle γ, or vice versa. Construct
a graph with these circles as vertices, and connect two circles with an edge if they form a
scribable pair. Is this graph always planar?

Problem 6. A function f : N → N is called spicy if there exists a nonconstant function

g : N → N so that, for all positive integers n,

f (n) + g(n) = f g(n) (n) + g f (n) (n).

Note that f a (x) denotes f (f (· · · f (x) · · · )). Does there exist a function f0 : N → N satisfying
| {z }
a copies of f
the following conditions?

• If f (n) ≤ f0 (n) for all n ∈ N, then f is spicy.

• If f (n) > f0 (n) for all n ∈ N, then f is not spicy.

Time limit: 3 hours.

Each problem is worth 7 points.