INMO Hard Mock 1

Sophie Fellowship

February 14, 2022

Submit by February 18
Time: 2.5hrs

INMO Hard Mock 1

Problem 1. Let π(n) denote the number of primes less than or equal to n. A subset of S =
{1, 2, · · · , n} is called primitive if there are no two elements in it with one of them dividing the
other. Prove that for n ≥ 5 and 1 ≤ k < π(n) 2 , the number of primitive subsets of S with k + 1
elements is greater or equal to the number of primitive subsets of S with k elements.

Problem 2. Let Fm be the mth Fibonacci number, defined by F1 = F2 = 1 and Fm = Fm−1 + Fm−2
for all m ≥ 3. Let p(x) be the polynomial of degree 1008 such that p(2n + 1) = F2n+1 for
n = 0, 1, 2, . . . , 1008. Find integers j and k such that p(2019) = Fj − Fk .

Problem 3. Let ω be the incircle of the triangle ABC and with centre I. Let Γ be the circumcircle
of the triangle AIB. Circles ω and Γ intersect at the point X and Y . Let Z be the intersection of
the common tangents of the circles ω and Γ. Show that the circumcircle of the triangle XY Z is
tangent to the circumcircle of the triangle ABC.