Scribd
Upload
141 views4 pages

Sophie Mocks3

The document outlines mock test problems in the style of the International Mathematical Olympiad (IMO) and the Indian National Mathematics Olympiad (INMO). It contains 6 problems for each of two days in the IMO format, and 6 additional problems in the INMO type. The problems cover topics such as combinatorics, number theory, geometry and graph theory. Instructions are provided for submitting tests for feedback.

Uploaded by

P B Chaudhary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
141 views4 pages

Sophie Mocks3

The document outlines mock test problems in the style of the International Mathematical Olympiad (IMO) and the Indian National Mathematics Olympiad (INMO). It contains 6 problems for each of two days in the IMO format, and 6 additional problems in the INMO type. The problems cover topics such as combinatorics, number theory, geometry and graph theory. Instructions are provided for submitting tests for feedback.

Uploaded by

P B Chaudhary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Sophie Fellowship Mock Tests

Rohan Goyal
December 6, 2021

Contents
1 IMO Format 2
1.1 Day 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 Day 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

2 INMO Type 4
All the best!

If you want to submit the test for feedback, please send to Rohan or Pranjal.

1
Rohan Goyal (December 6, 2021) Sophie Fellowship Mock Tests

§1 IMO Format
§1.1 Day 1
Problem 1.1. A 2020k × 2020k square is perfectly tiled with rectangles of dimensions
1 × k (rotation of tiles is allowed). Prove that there is a k × k sub-square which is perfectly
covered by k tiles.

Problem 1.2. An acute angled triangle T is inscribed in circle Ω.Denote by Γ the nine-
point circle of T .A circle ω passes through two of the vertices of T , and centre of Ω.Prove
that the common external tangents of Γ and ω meet on the external bisector of the angle
at third vertex of T .

Problem 1.3. For a given integer n ≥ 2, let a0 , a1 , . . . , an be integers satisfying 0 =


a0 < a1 < . . . < an = 2n − 1. Find the smallest possible number of elements in the set
{ai + aj | 0 ≤ i ≤ j ≤ n}.

2
Rohan Goyal (December 6, 2021) Sophie Fellowship Mock Tests

§1.2 Day 2
Problem 1.4. Given two forests A and B with V (A) = V (B ), that is the graphs are over
same vertex set. Suppose A has strictly more edges than B. Prove that there exists an
edge of A which if included in the edge set of B, then B will still remain a forest. Graphs
are undirected

Problem 1.5. Let Q(x) be a polynomial with integer coefficients. Prove that there exists
a polynomial P (x) with integer coefficients such that for every integer n ≥ deg Q,
n
!iP (i)
= Q(n),
X

i=0
i!(n − i)!

where !i denotes the number of derangements (permutations with no fixed points) of


1, 2, . . . , i.

Problem 1.6. Bob marks three special points A, B, C on the plane, such that the euler
line of ABC is not parallel to BC. Given a special point P (ie P is one of A, B, C), and
an arbitrary point Q, Alice can draw in line P Q and the circle centred at P that passes
through Q. Prove that Alice can construct the intersection of the euler line of ABC with
BC.

3
Rohan Goyal (December 6, 2021) Sophie Fellowship Mock Tests

§2 INMO Type
Problem 2.1. Let k be a fixed positive integer. Suppose a function f : Z → R satisfies:
f (xy ) ≥ f (x)f (y ) for all x, y ∈ Z f (x + k ) = f (x) for all x ∈ Z Prove that
k
f (i) ≥ 0
X

i=1

Problem 2.2. Given two forests A and B with V (A) = V (B ), that is the graphs are over
same vertex set. Suppose A has strictly more edges than B. Prove that there exists an
edge of A which if included in the edge set of B, then B will still remain a forest. Graphs
are undirected

Problem 2.3. Let M > 1 be a natural number. Tom and Jerry play a game. Jerry wins
if he can produce a function f : N → N satisfying

• f (M ) ̸= M

• f (k ) < 2k for all k ∈ N

• f f (n) (n) = n for all n ∈ N.

Tom wins otherwise. Prove that for infinitely many M , Tom wins, and for infinitely
many M , Jerry wins.

Problem 2.4. An acute angled triangle T is inscribed in circle Ω.Denote by Γ the nine-
point circle of T .A circle ω passes through two of the vertices of T , and centre of Ω.Prove
that the common external tangents of Γ and ω meet on the external bisector of the angle
at third vertex of T .

Problem 2.5. Let Q(x) be a polynomial with integer coefficients. Prove that there exists
a polynomial P (x) with integer coefficients such that for every integer n ≥ deg Q,
n
!iP (i)
= Q(n),
X

i=0
i!(n − i)!

where !i denotes the number of derangements (permutations with no fixed points) of


1, 2, . . . , i.

Problem 2.6. A 2020k × 2020k square is perfectly tiled with rectangles of dimensions
1 × k (rotation of tiles is allowed). Prove that there is a k × k sub-square which is perfectly
covered by k tiles.

You might also like