INMO Mock-4

Gunjan

Problem 1. Suppose q0 , q1 , q2 , . . . is an infinite sequence of integers satisfying the

following two conditions:
(i) m − n divides qm − qn for m > n ≥ 0,
(ii) there is a polynomial P such that |qn | < P (n) for all n
Prove that there is a polynomial Q such that qn = Q(n) for all n.

Problem 2. Suppose ABCD is a square piece of cardboard with side length a. On a

plane are two parallel lines ℓ1 and ℓ2 , which are also a units apart. The square ABCD is
placed on the plane so that sides AB and AD intersect ℓ1 at E and F respectively. Also,
sides CB and CD intersect ℓ2 at G and H respectively. Let the perimeters of △AEF
and △CGH be m1 and m2 respectively.

Prove that no matter how the square was placed, m1 + m2 remains constant.

Problem 3. Let n be a positive odd integer. There are n computers and exactly one
cable joining each pair of computers. You are to color the computers and cables such
that no two computers have the same color, no two cables joined to a common computer
have the same color, and no computer is assigned the same color as any cable joined to
it. Prove that this can be done using n colors.

Problem 4. Let a0 , b0 be positive integers, and define

√ √
ai+1 = ai + ⌊ bi ⌋ and bi+1 = bi + ⌊ ai ⌋ for all i ≥ 0

Show that there exists a positive integer n such that an = bn .

Problem 5. Inside the inscribed quadrilateral ABCD are marked points P and Q,
such that ∠P DC + ∠P CB, ∠P AB + ∠P BC, ∠QCD + ∠QDA and ∠QBA + ∠QAD
are all equal to 90◦ . Prove that the line P Q has equal angles with lines AD and BC.

Problem 6. Fifteen stones are placed on a 4×4 board, one in each cell, the remaining
cell being empty. Whenever two stones are on neighbouring cells (having a common
side), one may jump over the other to the opposite neighbouring cell, provided this cell
is empty. The stone jumped over is removed from the board.
For which initial positions of the empty cell is it possible to end up with exactly one
stone on the board?