You are on page 1of 10

Problems and Solutions: CRMO-2012, Paper 1

1. Let ABC be a triangle and D be a point on the segment BC such that DC = 2BD.
Let E be the mid-point of AC. Let AD and BE intersect in P . Determine the ratios
BP/P E and AP/P D.
Solution: Let F be the midpoint of DC,
so that D, F are points of trisection of BC.
Now in triangle CAD, F is the mid-point of
CD and E is that of CA. Hence CF/F D =
1 = CE/EA. Thus EF k AD. Hence we find
that EF k P D. Hence BP/P E = BD/DF .
But BD = DF . We obtain BP/P E = 1.
In triangle ACD, since EF k AD we get EF/AD = CF/CD = 1/2. Thus AD = 2EF .
But P D/EF = BD/BF = 1/2. Hence EF = 2P D. Therefore
This gives
AP = AD P D = 3P D.
We obtain AP/P D = 3.
(Coordinate geometry proof is also possible.)
2. Let a, b, c be positive integers such that a divides b3 , b divides c3 and c divides a3 .
Prove that abc divides (a + b + c)13 .
Solution: If a prime p divides a, then p | b3 and hence p | b. This implies that p | c3
and hence p | c. Thus every prime dividing a also divides b and c. By symmetry,
this is true for b and c as well. We conclude that a, b, c have the same set of prime
divisors.
Let px || a, py || b and pz || c. (Here we write px || a to mean px | a and px+1 6| a.) We may
assume min{x, y, z} = x. Now b | c3 implies that y 3z; c | a3 implies that z 3x. We
obtain
y 3z 9x.
Thus x + y + z x + 3x + 9x = 13x. Hence the maximum power of p that divides abc
is x + y + z 13x. Since x is the minimum among x, y, z, whence px divides each of
a, b, c. Hence px divides a + b + c. This implies that p13x divides (a + b + c)13 . Since
x + y + z 13x, it follows that px+y+z divides (a + b + c)13 . This is true of any prime p
dividing a, b, c. Hence abc divides (a + b + c)13 .
3. Let a and b be positive real numbers such that a + b = 1. Prove that
aa bb + ab ba 1.
Solution: Observe
1 = a + b = aa+b ba+b = aa bb + ba bb .
Hence
1 aa bb ab ba = aa bb + ba bb aa bb ab ba = (aa ba )(ab bb )
Now if a b, then aa ba and ab bb . If a b, then aa ba and ab bb . Hence the
product is nonnegative for all positive a and b. It follows that
aa bb + ab ba 1.

www.examrace.com

4. Let X = {1, 2, 3, . . . , 10}. Find the the number of pairs {A, B} such that A X,
B X, A 6= B and A B = {2, 3, 5, 7}.
Solution: Let A B = Y , B \ A = M , A \ B = N and X \ Y = L. Then X is the
disjoint union of M , N , L and A B. Now A B = {2, 3, 5, 7} is fixed. The remaining
six elements 1, 4, 6, 8, 9, 10 can be distributed in any of the remaining sets M , N , L.
This can be done in 36 ways. Of these if all the elements are in the set L, then
A = B = {2, 3, 5, 7} and which this case has to be deleted. Hence the total number
of pairs {A, B} such that A X, B X, A 6= B and A B = {2, 3, 5, 7} is 36 1.
5. Let ABC be a triangle. Let BE and CF be internal angle bisectors of B and C
respectively with E on AC and F on AB. Suppose X is a point on the segment CF
such that AX CF ; and Y is a point on the segment BE such that AY BE. Prove
that XY = (b + c a)/2 where BC = a, CA = b and AB = c.
Solution: Produce AX and AY to meet
BC is X 0 and Y 0 respectively. Since BY
bisects ABY 0 and BY AY 0 it follows
that BA = BY 0 and AY = Y Y 0 . Similarly,
CA = CX 0 and AX = XX 0 . Thus X and
Y are mid-points of AX 0 and AY 0 respectively. By mid-point theorem XY = X 0 Y 0 /2.
But
X 0 Y 0 = X 0 C + Y 0 B BC = AC + AB BC = b + c a.
Hence XY = (b + c a)/2.
6. Let a and b be real numbers such that a 6= 0. Prove that not all the roots of ax4 +
bx3 + x2 + x + 1 = 0 can be real.
Solution: Let 1 , 2 , 3 , 4 be the roots of ax4 + bx3 + x2 + x + 1 = 0. Observe none of
these is zero since their product is 1/a. Then the roots of x4 + x3 + x2 + bx + a = 0 are
1 =
We have

4
X

1
1
1
1
, 2 =
, 3 =
, 4 =
.
1
2
3
4

j = 1,

1 j < k 4j k = 1.

j=1

Hence
4
X
j=1

j2 =

4
X
j=1

j 2

j k = 1 2 = 1.

1j<k4

This shows that not all j can be real. Hence not all j s can be real.
-00000-

www.examrace.com

Problems and Solutions: CRMO-2012, Paper 2


1. Let ABCD be a unit square. Draw a quadrant of a circle with A as centre and B, D
as end points of the arc. Similarly, draw a quadrant of a circle with B as centre and
A, C as end points of the arc. Inscribe a circle touching the arc AC internally, the
arc BD internally and also touching the side AB. Find the radius of the circle .
Solution: Let O be the centre of . By
symmetry O is on the perpendicular bisector of AB. Draw OE AB. Then
BE = AB/2 = 1/2. If r is the radius of ,
we see that OB = 1 r, and OE = r. Using
Pythagoras theorem
2
(1 r)2 = r2 + 21 .
Simplification gives r = 3/8.
2. Let a, b, c be positive integers such that a divides b4 , b divides c4 and c divides a4 .
Prove that abc divides (a + b + c)21 .
Solution: If a prime p divides a, then p | b4 and hence p | b. This implies that p | c4
and hence p | c. Thus every prime dividing a also divides b and c. By symmetry,
this is true for b and c as well. We conclude that a, b, c have the same set of prime
divisors.
Let px || a, py || b and pz || c. (Here we write px || a to mean px | a and px+1 6| a.) We may
assume min{x, y, z} = x. Now b | c4 implies that y 4z; c | a4 implies that z 4x. We
obtain
y 4z 16x.
Thus x + y + z x + 4x + 16x = 21x. Hence the maximum power of p that divides abc
is x + y + z 21x. Since x is the minimum among x, y, z, px divides a, b, c. Hence px
divides a + b + c. This implies that p21x divides (a + b + c)21 . Since x + y + z 21x,
it follows that px+y+z divides (a + b + c)21 . This is true of any prime p dividing a, b, c.
Hence abc divides (a + b + c)21 .
3. Let a and b be positive real numbers such that a + b = 1. Prove that
aa bb + ab ba 1.
Solution: Observe
1 = a + b = aa+b ba+b = aa bb + ba bb .
Hence
1 aa bb ab ba = aa bb + ba bb aa bb ab ba = (aa ba )(ab bb )
Now if a b, then aa ba and ab bb . If a b, then aa ba and ab bb . Hence the
product is nonnegative for all positive a and b. It follows that
aa bb + ab ba 1.
4. Let X = {1, 2, 3, . . . , 12}. Find the the number of pairs {A, B} such that A X,
B X, A 6= B and A B = {2, 3, 5, 7, 8}.
Solution: Let A B = Y , B \ A = M , A \ B = N and X \ Y = L. Then X is the disjoint
union of M , N , L and A B. Now A B = {2, 3, 5, 7, 8} is fixed. The remaining seven
www.examrace.com
elements 1, 4, 6, 9, 10, 11, 12 can be distributed in any of the remaining sets M , N , L.

This can be done in 37 ways. Of these if all the elements are in the set L, then
A = B = {2, 3, 5, 7, 8} and this case has to be omitted. Hence the total number of
pairs {A, B} such that A X, B X, A 6= B and A B = {2, 3, 5, 7, 8} is 37 1.
5. Let ABC be a triangle. Let D, E be a points on the segment BC such that BD =
DE = EC. Let F be the mid-point of AC. Let BF intersect AD in P and AE in Q
respectively. Determine BP/P Q.
Solution: Let D be the mid-point of BE.
Join AD and let it intersect BF in P . Extend CQ and EP to meet AB in S and T
respectively. Now
BS
[BQC]
[BQC]/[AQB]
=
=
SA
[AQC]
[AQC]/[AQB]
CF/F A
1
=
=
= 2.
EC/BE
1/2
Similarly,
[ABQ]
[ACQ]
[ABQ] + [ACQ]
[ABQ] [ACQ]
AF
AS
1
3
AQ
=
=
=
=
+
=
+
=1+ = .
QE
[EBQ]
[ECQ]
[BCQ]
[BCQ] [BCQ]
FC
SB
2
2
And

AT
[AP E]
[AP E] [AP B]
DE AQ
3
3
=
=

=1 = .
TB
[BP E]
[AP B] [BP E]
DB QE
2
2

Finally,
BP
[BP E]
[BP A]
[BP E] + [BP A]
[BP E] [BP A]
BT
BD
2
5
=
=
=
=
+
=
+
= +1 = .
PQ
[QP E]
[AP E]
[AP E]
[AP E] [AP E]
T A DE
3
3
(Note: BS/SA, AT /T B can also be obtained using Cevas theorem. A solution can
also be obtained using coordinate geometry.)
6. Show that for all real numbers x, y, z such that x + y + z = 0 and xy + yz + zx = 3,
the expression x3 y + y 3 z + z 3 x is a constant.
Solution: Consider the equation whose roots are x, y, z:
(t x)(t y)(t z) = 0.
This gives t3 3t = 0, where = xyz. Since x, y, z are roots of this equation, we
have
x3 3x = 0, y 3 3y = 0, z 3 3z = 0.
Multiplying the first by y, the second by z and the third by x, we obtain
x3 y 3xy y = 0,
y 3 z 3yz z = 0,
z 3 x 3zx x = 0.
Adding we obtain
x3 y + y 3 z + z 3 x 3(xy + yz + zx) (x + y + z) = 0.
This simplifies to
x3 y + y 3 z + z 3 x = 9.
(Here one may also solve for y and z in terms of x and substitute these values in
x3 y + y 3 z + z 3 x to get 9.)
-00000-

www.examrace.com

Problems and Solutions: CRMO-2012, Paper 3


1. Let ABCD be a unit square. Draw a quadrant of a circle with A as centre and B, D
as end points of the arc. Similarly, draw a quadrant of a circle with B as centre
and A, C as end points of the arc. Inscribe a circle touching the arcs AC and BD
both externally and also touching the side CD. Find the radius of the circle .
Solution: Let O be the centre of . By symmetry O is on the perpendicular bisector of
CD. Draw OL CD and OK BC. Then
OK = CL = CD/2 = 1/2. If r is the radius
of , we see that BK = 1 r, and OE = r.
Using Pythagoras theorem
2
(1 + r)2 = (1 r)2 + 12 .
Simplification gives r = 1/16.
2. Let a, b, c be positive integers such that a divides b5 , b divides c5 and c divides a5 .
Prove that abc divides (a + b + c)31 .
Solution: If a prime p divides a, then p | b5 and hence p | b. This implies that p | c4
and hence p | c. Thus every prime dividing a also divides b and c. By symmetry,
this is true for b and c as well. We conclude that a, b, c have the same set of prime
divisors.
Let px || a, py || b and pz || c. (Here we write px || a to mean px | a and px+1 6| a.) We may
assume min{x, y, z} = x. Now b | c5 implies that y 5z; c | a5 implies that z 5x. We
obtain
y 5z 25x.
Thus x + y + z x + 5x + 25x = 31x. Hence the maximum power of p that divides abc
is x + y + z 31x. Since x is the minimum among x, y, z, px divides a, b, c. Hence px
divides a + b + c. This implies that p31x divides (a + b + c)21 . Since x + y + z 31x,
it follows that px+y+z divides (a + b + c)31 . This is true of any prime p dividing a, b, c.
Hence abc divides (a + b + c)31 .
3. Let a and b be positive real numbers such that a + b = 1. Prove that
aa bb + ab ba 1.
Solution: Observe
1 = a + b = aa+b ba+b = aa bb + ba bb .
Hence
1 aa bb ab ba = aa bb + ba bb aa bb ab ba = (aa ba )(ab bb )
Now if a b, then aa ba and ab bb . If a b, then aa ba and ab bb . Hence the
product is nonnegative for all poitive a and b. It follows that
aa bb + ab ba 1.
4. Let X = {1, 2, 3, . . . , 10}. Find the the number of pairs {A, B} such that A X,
B X, A 6= B and A B = {5, 7, 8}.
Solution: Let A B = Y , B \ A = M , A \ B = N and X \ Y = L. Then X is the
disjoint union of M , N , L and A B. Now A B = {5, 7, 8} is fixed. The remaining
www.examrace.com
seven elements 1, 2, 3, 4, 6, 9, 10 can be distributed in any of the remaining sets M ,

N , L. This can be done in 37 ways. Of these if all the elements are in the set L, then
A = B = {5, 7, 8} and this case has to be omitted. Hence the total number of pairs
{A, B} such that A X, B X, A 6= B and A B = {5, 7, 8} is 37 1.
5. Let ABC be a triangle. Let D, E be a points on the segment BC such that BD =
DE = EC. Let F be the mid-point of AC. Let BF intersect AD in P and AE in
Q respectively. Determine the ratio of the area of the triangle AP Q to that of the
quadrilateral P DEQ.
Solution: If we can find [AP Q]/[ADE],
then we can get the required ratio as
[AP Q]
[AP Q]
=
[P DEQ]
[ADE] [AP Q]
=

1

.
[ADE]/[AP Q] 1

Now draw P M AE and DL AE. Observe


[AP Q] = 12 AQ P M , [ADE] = 12 AE DL.
Further, since P M k DL, we also get P M/DL = AP/AD. Using these we obtain
[AP Q]
AP AQ
=

.
[ADE]
AD AE
We have
AQ
[ABQ]
[ACQ]
[ABQ] + [ACQ]
[ABQ] [ACQ]
AF
AS
=
=
=
=
+
=
+
.
QE
[EBQ]
[ECQ]
[BCQ]
[BCQ] [BCQ]
FC
SB
However

BS
[BQC]
[BQC]/[AQB]
CF/F A
1
=
=
=
=
= 2.
SA
[AQC]
[AQC]/[AQB]
EC/BE
1/2

Besides AF/F C = 1. We obtain


AQ
AF
AS
1
3
=
+
=1+ = ,
QE
FC
SB
2
2

AE
3
5
=1+ = ,
QE
2
2

AQ
3
= .
AE
5

Since EF k AD (since DE/EC = AF/F C = 1), we get AD = 2EF . Since EF k P D, we


also have P D/EF = BD/DE = 1/2. Hence EF = 2P D. Thus AD = 4P D. This gives
and AP/P D = 3 and AP/AD = 3/4. Thus
[AP Q]
AP AQ
3 3
9
=

= = .
[ADE]
AD AE
4 5
20
Finally,
[AP Q]
1
1
9

=
=
= .
[P DEQ]
(20/9) 1
11
[ADE]/[AP Q] 1
(Note: BS/SA can also be obtained using Cevas theorem. Coordinate geometry
solution can also be obtained.)
6. Find all positive integers n such that 32n + 3n2 + 7 is a perfect square.
Solution: If 32n + 3n2 + 7 = b2 for some natural number b, then b2 > 32n so that
www.examrace.com
b > 3n . This implies that b 3n + 1. Thus

32n + 3n2 + 7 = b2 (3n + 1)2 = 32n + 2 3n + 1.


This shows that 2
3n2 + 6. If n 3, this cannot hold. One can prove this eithe
by induction or by direct argument:
If n 3, then
3n



2 3n = 2(1 + 2)n = 2 1 + 2n + n(n 1)/2) 22 + > 2 + 4n + 4n2 4n
= 3n2 + (n2 + 2) 3n2 + 11 > 3n2 + 6.
Hence n = 1 or 2.
If n = 1, then 32n + 3n2 + 7 = 19 and this is not a perfect square. If n = 2, we obtain
32n + 3n2 + 7 = 81 + 12 + 7 = 100 = 102 . Hence n = 2 is the only solution.
-00000-

www.examrace.com

Problems and Solutions: CRMO-2012, Paper 4


1. Let ABCD be a unit square. Draw a quadrant of a circle with A as centre and B, D
as end points of the arc. Similarly, draw a quadrant of a circle with B as centre and
A, C as end points of the arc. Inscribe a circle touching the arc AC externally, the
arc BD internally and also touching the side AD. Find the radius of the circle .
Solution: Let O be the centre of and r
its radius. Draw OP AD and OQ AB.
Then OP = r, OQ2 = OA2 r2 = (1 r)2
r2 = 1 2r. We also have OB = 1 + r and
BQ = 1 r. Using Pythagoras theorem we
get
(1 + r)2 = (1 r)2 + 1 2r.
Simplification gives r = 1/6.
2. Let a, b, c be positive integers such that a divides b2 , b divides c2 and c divides a2 .
Prove that abc divides (a + b + c)7 .
Solution: If a prime p divides a, then p | b2 and hence p | b. This implies that p | c2
and hence p | c. Thus every prime dividing a also divides b and c. By symmetry,
this is true for b and c as well. We conclude that a, b, c have the same set of prime
divisors.
Let px || a, py || b and pz || c. (Here we write px || a to mean px | a and px+1 6| a.) We may
assume min{x, y, z} = x. Now b | c2 implies that y 2z; c | a2 implies that z 2x. We
obtain
y 2z 4x.
Thus x + y + z x + 2x + 4x = 7x. Hence the maximum power of p that divides abc
is x + y + z 7x. Since x is the minimum among x, y, z, px divides a, b, c. Hence px
divides a + b + c. This implies that p7x divides (a + b + c)7 . Since x + y + z 7x, it
follows that px+y+z divides (a + b + c)7 . This is true of any prime p dividing a, b, c.
Hence abc divides (a + b + c)7 .
3. Let a and b be positive real numbers such that a + b = 1. Prove that
aa bb + ab ba 1.
Solution: Observe
1 = a + b = aa+b ba+b = aa bb + ba bb .
Hence
1 aa bb ab ba = aa bb + ba bb aa bb ab ba = (aa ba )(ab bb )
Now if a b, then aa ba and ab bb . If a b, then aa ba and ab bb . Hence the
product is nonnegative for all positive a and b. It follows that
aa bb + ab ba 1.
4. Let X = {1, 2, 3, . . . , 11}. Find the the number of pairs {A, B} such that A X,
B X, A 6= B and A B = {4, 5, 7, 8, 9, 10}.
Solution: Let A B = Y , B \ A = M , A \ B = N and X \ Y = L. Then X is the
disjoint union of M , N , L and A B. Now A B = {4, 5, 7, 8, 9, 10} is fixed. The
www.examrace.com
remaining 5 elements 1, 2, 3, 6, 11 can be distributed in any of the remaining sets M ,

N , L. This can be done in 35 ways. Of these if all the elements are in the set L, then
A = B = {4, 5, 7, 8, 9, 10} and this case has to be omitted. Hence the total number of
pairs {A, B} such that A X, B X, A 6= B and A B = {4, 5, 7, 8, 9, 10} is 35 1.
5. Let ABC be a triangle. Let E be a point on the segment BC such that BE = 2EC.
Let F be the mid-point of AC. Let BF intersect AE in Q. Determine BQ/QF .
Solution: Let CQ and ET meet AB in S
and T respectively. We have
[SBC]
BS
[SBQ]
=
=
.
[ASC]
SA
[ASQ]
Using componendo by dividendo, we obtain
BS
[SBC] [SBQ]
[BQC]
=
=
.
SA
[ASC] [ASQ]
[AQC]
Similarly, We can prove
BE
[BQA]
=
,
EC
[CQA]

CF
[CQB]
=
.
FA
[AQB]

But BD = DE = EC implies that BE/EC = 2; CF = F A gives CF/F A = 1. Thus


[BQC]
[BQC]/[AQB]
CF/F A
1
BS
=
=
=
=
= 2.
SA
[AQC]
[AQC]/[AQB]
EC/BE
1/2
Now

BQ
[BQC]
[BQA]
[BQC] + [BQA]
[BQC] + [BQA]
=
=
=
=
.
QF
[F QC]
[F QA]
[F QC] + [F QA]
[AQC]

This gives
BQ
[BQC] + [BQA]
[BQC] [BQA]
BS BE
=
=
+
=
+
= 2 + 2 = 4.
QF
[AQC]
[AQC] [AQC]
SA EC
(Note: BS/SA can also be obtained using Cevas theorem. One can also obtain the
result by coordinate geometry.)
6. Solve the system of equations for positive real numbers:
1
x
= + 1,
xy
z

1
y
= + 1,
yz
x

1
z
= + 1.
zx
y

Solution: The given system reduces to


z = x2 y + xyz, x = y z + xyz, y = z 2 x + xyz.
Hence
z x2 y = x y 2 z = y z 2 x.
If x = y, then y 2 z = z 2 x and hence x2 z = z 2 x. This implies that z = x = y. Similarly,
x = z implies that x = z = y. Hence if any two of x, y, z are equal, then all are equal.
Suppose no two of x, y, z are equal. We may take x is the largest among x, y, z so
that x > y and x > z. Here we have two possibilities: y > z and z > y.
Suppose x > y > z. Now z x2 y = x y 2 z = y z 2 x shows that
www.examrace.com
y 2 z > z 2 x > x2 y.

But y 2 z > z 2 x and z 2 x > x2 y give y 2 > zx and z 2 > xy. Hence
(y 2 )(z 2 ) > (zx)(xy).
2
3
This gives yz > x . Thus x < xyz = (xz)y < (y 2 )y = y 3 . This forces x < y contradicting x > y.
Similarly, we arrive at a contradiction if x > z > y. The only possibility is x = y = z.

For x = y = z, we get only one equation x2 = 1/2. Since x > 0, x = 1/ 2 = y = z.


-0000-

www.examrace.com

You might also like