RMO MOCK 2025

Paper 1
Komal Ghadigaonkar

October 1, 2025

1. In the quadrilateral ABCD, AD is parallel to BC. LetK is a point on AB.

Draw the line through A parallel to KC and the line through B parallel
to KD. Prove that these two lines intersect at some point on CD.

Answer: Let CK cut the extension of DA at R and DK cut the exten-

sion of CB at Q.
Let the line through A parallel to KC cut CD at H and the extension of
BC at P .
Then AP CR is a parallelogram, so that AR = CP .
We have to prove that BH is parallel to KC. Let the extension of BH
cut the extension of AD at S.
Now triangles BKQ and AKD are similar, as are triangles BKC and
BQ
AKR. Hence AD = BK BC
AK = AR .
Similarly, BC = CP . Hence BQ = BC·AD
DS AD
AR = BC·AD
CP = DS.
It follows that BQDS is also a parallelogram, so that BH is indeed par-
allel to KD.

1
 KGM Proof Using Projective Plane.
Let line through A parallel to KC be l.
Let l ∩ KC = P∞ , l ∩ KD = M . and l ∩ CD = H.
We will prove that BH∥KD.
Menelaues in △KCD with transversal M, H, P ∞
KM DH CP∞
× × = −1
MD HC P∞ K
KM HC
⇒ = .
MD DH

2. At the end of the school year it became clear that for any arbitrarily chosen
group of no less than 5 students, 80% of the marks "F" received by this
group were given to no more than 20% of the students in the group. Prove
that at least 3/4 of all " F " marks were given to the same student.
Solution. Let us arrange all the students in the school according to the
number of "F" marks they received. So, F1 ≥ F2 ≥ · · · ≥ Fn where Fj
Pnthe number of "F" received by j-th student, 1 ≤ j ≤ n, Fj ≥ 0 and
is
j=1 Fj = F where F is a total number of " F " marks.
Now let us consider the first five students. According to the condition,
one student (who has to be on top of the list) got at least 80% of "F"
marks received by this group which leaves no more than 20% of "F" marks
remaining for the other four students. So, F2 + F3 + F4 + F5 ≤ 14 F4
and we have an estimate F2 ≤ 14 F1 . Considering students from k-th to
k + 4-th (k + 4 ≤ n) we conclude that Fk+1 ≤ 41 Fk which implies that
Fk+1 ≤ 41k F1 , (k ≤ n − 5) and Fn−3 + Fn−2 + Fn−1 + Fn ≤ 14 Fn−4 .
Now we have
F = F1 + F2 + · · · + Fn−4 + (Fn−3 + · · · + Fn ) ≤
∞
1 1 1 1 X 1 F1 4
F1 + F1 + 2 F1 + · · · + n−5 F1 + n−4 F1 < F1 = = F1 ;
4 4 4 4 4k
k=0
1 − 14 3

Therefore F1 > 43 F .
3. Alex places a rook on any square of an empty 8 × 8 chessboard. Then he
places additional rooks one rook at a time, each attacking an odd number
of rooks which are already on the board. A rook attacks to the left, to the
right, above and below, and only the first rook in each direction. What is
the maximum number of rooks Alex can place on the chessboard?
solution:- After three corner squares have been occupied, a rook at the
fourth corner square will always be attacking two existing rooks. Hence
at least one corner square must be empty, so that the maximum number
of rooks that can be placed is sixty-three. The diagram below shows how

2
 Alex can place as many as sixty-three rooks in three stages labelled A, B

and C.
4. Suppose α, β are two positive rational numbers. Assume for some positive
1 1
integers m, n, it is known that α n + β m is a rational number. Prove that
1 1
each of α n and β m is a rational number.
1 1
Solution:Let α n + β m = k where k is rational Look at the polynomials

p(x) = xn − α

q(x) = (k − x)m − β
Note we know that
1 1 1 1
xn − α = (x − α n )(x − ωn α n )(x − ωn2 α n )...(x − ωnn−1 α n )

where ωn = nth root of unity.

1
Hence these are polynomials over rationals and have commom root α n
1
so (x − α n ) as a common factor, which is easily seen to be of single
1
multiplicity. Also if γ ̸= α is another common root then γ = ωn α n where
ω is a nth root of unity. But then
1 1
ωm β m = (k − ωn α n )
1 1 1 1
k = α n + β m = ωm β m + ωn α n ) − − − −(1)
1 1
As α, β are two positive rational numbers so α n , β m ∈ R
Hence by comparing the real parts of (1) , we get that both ωm , ωn have
real part equal to 1, a contradiction.
1
Hence (x − α n ) is only common root , and hence the gcd of p(x), q(x).
Since these polynomials are rational, their gcd is also rational (consider
euclidian algorithm to get the gcd).
1 1 1
Hence α n is rational and so β m = k − α n is also rational .

3
5. Let AHA , BHB and CHC be the altitudes of triangle △ABC. Prove that
the triangle whose vertices are the intersection points of the altitudes of
△AHB HC , △BHA HC and △CHA HB is congruent to △HA HB HC .

Solution. Let us notice that HC A1 HB H and HHA C1 HB are parallel-

ograms ( HHA and HB C1 are perpendicular to BC; HC A1 , HHB and
HA C1 are perpendicular to AC; HHC and HB A1 are perpendicular to
AB ).
Therefore HC A1 = HA C1 and since they are parallel we conclude that
HC HA C1 A1 is parallelogram, thus HC HA = A1 C1 . In a similar way
we can prove that HB HA = A1 B1 and HC HB = B1 C1 . Therefore
△HC HA HB ∼ = △A1 B1 C1 .
6. Let M be a set composed of n elements and let P(M ) be its power set.
Find all functions f : P(M ) → {0, 1, 2, . . . , n} that have the properties
(a) f (A) ̸= 0, for A ̸= ϕ;
(b) f (A ∪ B) = f (A ∩ B) + f (A∆B), for all A, B ∈ P(M ), where
A∆B = (A ∪ B)\(A ∩ B).
sol:
We will prove that there is only one function f (A) = |A| .

Claim 1 : f (ϕ) = 0
Proof:
f (ϕ) = f (ϕ) + f (ϕ) ⇒ f (ϕ) = 0.
f (A ∪ A) = f (A ∩ A) + f (A − A)
f (A) = f (A) + f (ϕ) ⇒ f (ϕ) = 0
Claim 2 :If A is proper subset of B that is A ⊂ B but A ̸= B, then
f (A) < f (B) .
Proof:
As f (A ∪ B) = f (A ∩ B) + f (A∆B) so f (B) = f (A) + f (A∆B)
and A∆B ̸= ϕ so f (A∆B) ̸= 0.
Hence f (A) < f (B).
Claim 3: If A = {a1 , a2 , ..., ak } then f (A) = f ({a1 }) + f ({a2 }) + ... + f ({ak })
Proof: By induction

4
Consider A1 = {a1 } , A2 = {a1 , a2 }, A2 = {a1 , a2 , a3 } and so on.
f (A ∪ B) = f (A ∩ B) + f (A∆B) − − − (1)
Applying (1) on A1 and A2 we get

f (A2 ) = f (A1 ) + f ({a2 }) = f ({a1 }) + f ({a2 })

Applying (1) on A2 and A3 we get

f (A3 ) = f (A2 ) + f ({a3 }) = f ({a1 }) + f ({a2 }) + f ({a3 })

and so on so we are done.

Claim 4 : f (A) = |A| .
Let M = {a1 , a2 , ..., an } then f (M ) = f ({a1 }) + f ({a2 }) + ... + f ({an })
As f ({ax }) ≥ 1 ∀x = 1, 2, .., n
So f (M ) ≥ n but maximum possible value of f is n so f (M ) = n
So f ({ax }) = 1 ∀x = 1, 2, .., n
As f (A) = f ({a1 }) + f ({a2 }) + ... + f ({ak }) = k =| A |
Hence there is only one function f (A) = |A| .