INMO Mock-2

Gunjan

Problem 1. There is a big dark bag with n strings. Every minute Pranjol draws two
random ends and ties them together. Find the expected number of loops (cycles formed
during the process among the strings) at the end of n minutes. Expected value is the
average value over all possibilities.

Problem 2. Let ABCD be a parallelogram. Point E lies on segment CD such that

2∠ AEB = ∠ ADB + ∠ ACB,

and point F lies on segment BC such that

2∠ DFA = ∠ DCA + ∠ DBA.

Let K be the circumcenter of triangle ABD. Prove that KE = KF.

Problem 3. Let a, b > 0. Prove that

  
2 8 2 8
a + b + ≥ 25
b+1 a+1

Problem 4. Alice writes N positive integers on a board. Each second, she chooses
two numbers x, y written on the board with x > y, and writes the number x2 − y2 on the
board. After some time, she sends the list of all the numbers on the board to Bob. He
notices that all the numbers from 1 to 1000 are present on the list. Aid Bob in finding the
minimum possible value of N.

Problem 5. Each point A in the plane is assigned a real number f ( A). Let ABCD be
a non-degenerate quadrilateral. The points M1 , M2 , M3 , M4 be the midpoints of AB, BC,
CD, DA. M is defined as M1 M3 ∩ M2 M4

f ( M ) = f ( A) + f ( B) + f (C ) + f ( D )

Prove that f ( A) = 0 for all points A.

Problem 6. Suppose r is a non-integer rational number. Show that there exist indefinite
prime numbers in the form of [nr ] where n ∈ N. Here [ x ] means the greatest integer less
than or equal to x.