Date: August 11, 2019 Time: 10 AM to 1 PM

Number of Questions: 30 Max Marks: 102

Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005

Ph.: 011-47623456

Answers & Solutions

for
PRMO - 2019
INSTRUCTIONS
1. Use of mobile phones, smartphones, iPads, calculators, programmable wrist watches is STRICTLY PROHIBITED.
Only ordinary pens and pencils are allowed inside the examination hall.
2. The correction is done by machines through scanning. On the OMR sheet, darken bubbles completely with a black
pencil or a black or blue ball pen. Darken the bubbles completely, only after you are sure of your answer; else,
erasing may lead to the OMR sheet getting damaged and the machine may not be able to read the answer.
3. The name, email address, and date of birth entered on the OMR sheet will be your login credentials for accessing
your PRMO score.
4. Incompletely, Incorrectly or carelessly filled information may disqualify your candidature.
5. Each question has a one or two digit number as answer. The first diagram below shows improper and proper way
of darkening the bubbles with detailed instructions. The second diagram shows how to mark a 2-digit number and
a 1-digit number.
Q. 1 Q. 2
INSTRUCTIONS
1. "Think before your ink". 47 05
2. Marking should be done with Blue/Black Ball Point Pen only. 0 0 0 0

3. Darken only one circle for each question as shown in 1 1 1 1

Example Below. 2 2 2 2

WRONG METHODS CORRECT METHOD 3 3 3 3

4 4 4 4

A D A C D 5 5 5 5

4. If more than one circle is darkened or if the response is 6 6 6 6

marked in any other way as shown "WRONG" above, it shall 7 7 7 7

be treated as wrong way of marking. 8 8 8 8

5. Make the marks only in the spaces provided. 9 9 9 9

6. Carefully tear off the duplicate copy of the OMR without

tampering the Original.
7. Please do not make any stray marks on the answer sheet.
6. The answer you write on OMR sheet is irrelevant. The darkened bubble will be considered as your final answer.
7. Questions 1 to 6 carry 2 marks each; questions 7 to 21 carry 3 marks each; questions 22 to 30 carry 5 marks each.
8. All questions are compulsory.
9. There are no negative marks.
10. Do all rough work in the space provided below for it. You also have blank pages at the end of the question paper
to continue with rough work.
11. After the exam, you may take away the Candidate's copy of the OMR sheet.
12. Preserve your copy of OMR sheet till the end of current olympiad season. You will need it later for verification purposes.
13. You may take away the question paper after the examination.

1
 PRMO-2019

1. From a square with sides of length 5, triangular Either

pieces from the four corners are removed to a–k=1 a–k=2
form a regular octagon. Find the area removed a+k =8 a+k=4
 2a = 6
to the nearest integer? 2a = 9

Answer (04) 9
a (rejected) a=3
2
Sol. a A 5 – 2a H a
 a2 + b2 = 32 + 22 = 13
a a 3. Let x1 be a positive real number and for every
integer n  1 let xn1  1  x1x2 ...xn1xn . If
B G
x5 = 43, what is the sum of digits of the largest
prime factor of x6?
Answer (13)
C F
Sol. x6 = 1 + x1x2x3x4x5
x5 = 1 + x1x2x3x4 = 43
D E x1x2x3x4 = 43 – 1 = 42
 x6 = 1 + 43 × 42 = 1807 = 139.13
5  2a  a 2
Greatest prime factor = 139
5  1  Sum of its digits = 1 + 3 + 9 = 13
a  5  1 
2 2  2 4. An ant leaves the anthill for its morning
exercise. It walks 4 feet east and then makes a
1 2
Area removed  4  a 160° turn to the right and walks 4 more feet. It
2 then makes another 160° turn to the right and
walks 4 more feet. If the ant continues this
( 2  1)2
 2  25 pattern until it reaches the anthill again, what
2 is the distance in feet it would have walked?
 4.3 Answer (36)
Sol. Let  be the angle by which path of ant
Area to nearest integer is 4
deviates from its previous path at each step
2. Let f(x) = x2 + ax + b. If for all nonzero real x ( = 160°)
 1  1 Net displacement of ant horizontally after n
f  x    f(x)  f   steps
 x  x
and the roots of f(x) = 0 are integers, what is = 4 1  cos   cos 2  ...  cos(n  1)
the value of a2 + b2 ?
 n  1  n 
Answer (13) 4 cos  sin  
2  2  0
= ...(i)
Sol. f(x) = x2 + ax + 6 
sin  
2
 1  1 Net displacement of ant vertically after n
f  x    f(x)  f  
 x x steps
2 = 4 0  sin   sin2  ...  sin(n  1)
 1  1 1  1
 x  x   a  x  x   b  x  2  a  x  x   2b
2

    x     n  1    n 
4 sin   sin  
 2   2  0
 b=2 = ...(ii)

sin  
Since f(x) = x2 + ax + 2 and roots are integers 2
 n 
 a must also be an integer Hence, sin    0 ,
 2 
For integral roots discriminant must be perfect So, 80 n must be multiple of 180.
square
n=9
a2 – 8 = k2  (a – k)(a + k) = 1.8 Distance covered = 4 × 9 = 36.
2
 PRMO-2019

5. Five persons wearing badges with numbers 1, Sol. Difference between angle made by minute and
2, 3, 4, 5 are seated on 5 chairs around a hour hand in one minute.
circular table. In how many ways can they be o
seated so that no two persons whose badges  1
 6  
have consecutive numbers are seated next to  2 
each other? (Two arrangements obtained by x 11x
rotation around the table are considered For x minute, 6x    90 or 270
2 2
different.)
90  2 270  2
Answer (10)  x ,
11 11
360
Sol. Difference =
A 11
8
 32 
11
a = 32
2
b=8
B c = 11
Let 2 is fixed (we can also fix 3 or 4)
Now, we can put only 4 or 5 at place of A and B i.e. a  b  c  51
1 8. How many positive integers n are there such
n
5 3 4 that 3  n  100 and x2  x  1 is divisible by
or 3
x2 + x + 1?
Answer (49)
2 1 2
Sol. If x2 + x +1 = 0,
4 5
Hence, total number of arrangement as per the then x = , 2
question = 2 × 5 = 10. where 1 +  + 2 = 0
6. Let abc be a three digit number with nonzero and 3 = 1
digits such that a2 + b2 = c2. What is the largest n n
possible prime factor of abc ? Now, x2  x  1  2    1 becomes zero
Answer (29) Iff 2n is divided by 3, gives remainder 2.
Sol. Let abc be 3 digit number with non-zero digits so, n = 3, 5, 7, ....., 99
satisfying a2 + b2 = c2
The number of integers = 49
as a, b, c {1, 2, 3, ... 9}
p
So, possible cases are 9. Let the rational number be closest to but
q
a = 3, b = 4, c = 5
22
OR not equal to among all rational numbers
7
a = 4, b = 3, c = 5 with denominator < 100. What is the value of
i.e., possible numbers are p – 3q?
345 = 3 × 5 × 23 …(i) Answer (14)
435 = 3 × 5 × 29 …(ii) 22 1
Sol. ∵  3
i.e., largest prime factor is 29. 7 7
7. On a clock, there are two instants between 1
12 noon and 1 PM, when the hour hand and the We need to find closest rational number to .
7
minute hand are at right angles. The difference
1 14
in minutes between these two instants is ∵ 
b 7 98
written as a  , where a, b, c are positive 1 14
c So closest fraction to will be
b 7 99
integers, with b < c and in the reduced
c p 14 311
form. What is the value of a + b + c? Then  3 
q 99 99
Answer (51) p – 3q = 14
3
 PRMO-2019

10. Let ABC be a triangle and let  be its x

circumcircle. The internal bisectors of angles Similarly, B2  45 
2
A, B and C intersect  at A 1 , B 1 and C 1
respectively and the internal bisectors of z
and C2  45 
angles A 1, B 1 and C 1 of the triangle A 1B1C 1 2
intersect  at A2, B2 and C2, respectively. If the
smallest angle of triangle ABC is 40°, what is let A be least
the magnitude of the smallest angle of triangle  y = 20°
A2B2C2 in degrees?
 A2 is least
Answer (55)
A  A2 = 45° + 10° = 55°
Sol.
11. How many distinct triangles ABC are there, up
yy
C1 B1 to similarity, such that the magnitudes of
angles A, B and C in degrees are positive
integers and satisfy
x z cos A cos B + sin A sin B sin kC = 1
x z
B C
for some positive integer k, where kC does not
exceed 360°?
A1
Fig-I Answer (06)

2x + 2y + 2z = 180°  cosA.cosB + sinA.sinB.sinkC = 1

 x + y + z = 90° If kCE (180°, 360°)
AA1C1 = z then cosA.cosB = 1 – sinA.sinB.sinkC
AA1B1 = x
 cosA.cosB  1 + sinA.sinB (Impossible case)
 A1 = x + z
If kCE (0°, 180°)
Similarly,
then cosA.cosB + sinA.sinB  1
B1 = z + y and
C1 = x + y  cos(A – B)  1

A2  A = B and kC = 90°

C1 B1 here C must be an even divisor of 90 = 2 x 32 x 5

So, number of possible values of C = 2 x 3 = 6

Total number of possible triangles = 06

C2 12. A natural number k > 1 is called good if there

B2 exist natural numbers

A1 a1 < a2 < ...< ak

Fig-II such that
Again, in fig-II,
1 1 1
A2 = B2A2A1 + A1A2C2 + + ... + =1
a1 a2 ak
= B2B1A1 + A1C1C2

zxyy xyz y Let f(n) be the sum of the first n good numbers,
   n  1. Find the sum of all values of n for which
2 2 2
f(n + 5)/f(n) is an integer.
y
 45  Answer (18)
2
4
 PRMO-2019

Sol. The first good number is 3 because Hence possible values of k2 = 102, 122, 142, 162,
18 2, 20 2, 22 2,..... for which k 2 + 47 must be
1 1 1
+ + =1 k2  47
4 9 36 divisible by 9 and must be prime. This
9
1 1 1 gives k = 22
Now we can split as +
9 16 144  pn + 6 = 59
So next good number will be 4.
 n  53
1 11 15. In how many ways can a pair of parallel
Similarily we can split + , as
256 diagonals of a regular polygon of 10 sides be
144 482
selected?
then next good number will be 5 and so on
Answer (45)
n(n + 5)
f(n) = 3 + 4 + 5 + ...n terms = A A
2 1 1
10 2 10 2
f(n + 5) n + 10 10 9 3
So; = = 1+ Sol. or 9 3
f(n) n n 8 4 8 4
 Possible values of n are 1, 2, 5, 10 7 5
6 7 6 5
Therefore, their sum = 18 B B
13. Each of the numbers x1, x2, .... x101 is  1. What Number of parallel diagonals is 4 and 3 when
it is symmetrical about line AB.
is the smallest positive value of  xi x j ?
1  i<j101 Number of symmetry in decagon is 5
Answer (10)  Total number of pair of parallel diagonals
Sol. Using  x1  x2  ...  x17   
2
xi2  2  x i ix j = 5 × (4C2 + 3C2)
= 45
  xi 
2
  101  2 xi x j 16. A pen costs `13 and a note book costs `17.
A school spends exactly `10000 in the year
1  i < j  101 2017-18 to buy x pens and y note books
such that x and y are as close as possible (i.e.,
For minimum possible positive value of xi  x j, |x – y| is minimum). Next year, in 2018-19 the
We have school spends a little more than `10000 and
buys y pens and x note books. How much more
 xi  11 , for 56 positive and 45 negative did the school pay?
value of xi Answer (40)
Sol. 13x + 17y = 10000 ...(i)
We have,  xi  x j  10 17x + 13y = 10000 + a ...(ii)
1  i < j 101 Add (i) and (ii) and subtract (i) from (ii), then
14. Find the smallest positive integer n  10 such 30(x + y) = 20000 + a ...(iii)
that n + 6 is a prime and 9n + 7 is a perfect
4(x – y) = a
square.
a
Answer (53)  x–y=
4
Sol. Since n + 6 = p is prime and Let a = 4k
9n + 7 = k2 is perfect square 20000  4k
But x  y 
 9(n + 6) – 54 + 7 = k2 30
10  2k
 9p = k2 + 47  666 
15
Since LHS is odd   k2 and hence k must be  k = 10 [∵ |x – y| is minimum]
even  a = 40
more over k2 = 9n + 7 > 97  School had to pay `40 extra in 2018-19.

5
 PRMO-2019

17. Find the number of ordered triples (a, b, c) of D

Sol. 90° –
positive integers such that 30a + 50b + 70c
2 – 90°
 343.
Answer (30)  90° – 
A B
C
Sol. Let 30a + 50b + 70c = 10n
Here a, b, c, n  N and n  34
 3a + 5b + 7c = n E
 3x + 5y + 7z = m Let the diameter of circle be 26
where m = n – 15 AC = 12, BC = 14
So m[0, 19]
7
Number of solutions = Sum of coeff. of all CD = 12tan = 14cot  tan2  
6
powers of x less than 20 in the expansion of
(1 + x3 + x6 +.....+ x18) (1 + x5 + x10 + x15) 1
So, cos 2  –
(1 + x7 + x14) 13
= (1 + x3 + x6 + x9 + x12 + x15 + x18)
1
[1 + x5 + x7 + x10 + x12 + x14 + x15 + x17 + x19] Now,  ABD   26  12 tan 
2
= 9+7+5+4+3+1+1
1
and CDE 
= 30  26  12 tan  sin(2 – 90)
18. How many ordered pairs (a, b) of positive 2
integers with a < b and 100  a, b  1000
satisfy gcd(a, b) : lcm(a, b) = 1 : 495? ABD  –1  13

Answer (20) CDE cos2
Sol. Let the gcd be x, so lcm will be 495x
20. Consider the set E of all natural numbers n
and ab = 495 x2 such that when divided by 11, 12, 13
respectively, the remainders, in that order, are
∵ 495 x2  106
distinct prime numbers in an arithmetic
 x  44 progression. If N is the largest number in E,
Also, 495 = 5 × 11 × 32 find the sum of digits of N.

So one out of a and b is divisible by 5 and other Answer (*)

by 11. Sol. Case : I N  3 (mod 11)
Let a = 1x and b = 2x (where x is gcd of a and b) N  5 (mod 12)
 1·2 = 495 = 5 × 11 × 32 (also 1<2) N  7 (mod 13)
and 1 and 2 are co-prime.
Using Chinese remainder theorem
1 2 x 156 x1  1 (mod 11)  x1 = 6
9 55 12, 13, ......, 18 (7 values)
143 x2  1 (mod 12)  x2 = –1
11 45 10, 11, 12, ......, 22 (13 values)
132 x3  1 (mod 13)  x3 = 7
Total number of ordered pairs of (a, b) = 20
N  8561 (mod 1716)  1697 (mod 1716)
19. Let AB be a diameter of a circle and let C be a
point on the segment AB such that AC : CB = Case : II N  7 (mod 11)
6 : 7. Let D be a point on the circle such that
DC is perpendicular to AB. Let DE be the N  5 (mod 12)
diameter through D. If [XYZ] denotes the area N  3 (mod 13)
of the triangle XYZ, find [ABD]/[CDE] to the
nearest integer. Using Chinese remainder theorem
Answer (13) N  8609 (mod 1716)  29 (mod 1716)

6
 PRMO-2019

Case : III N  3 (mod 11) 23. Let ABCD be a convex cyclic quadrilateral.
Suppose P is a point in the plane of the
N  7 (mod 12)
quadrilateral such that the sum of its
N  11 (mod 13) distances from the vertices of ABCD is the
least. If
Using Chinese remainder theorem;
{PA, PB, PC, PD} = {3, 4, 6, 8},
N  11971 (mod 1716)
what is the maximum possible area of ABCD?
N  1675 (mod 1716)
Answer (55)
*The minimum possible value of N is 29 but
Sol. Consider 5 points A, B, C, D and P in a plane.
maximum possible value can not be calculated.
Let distances of A, B, C and D from P be a, b,
21. Consider the set E = {5, 6, 7, 8, 9}. For any c, d respectively.
partition {A, B} of E, with both A and B non-
A
empty, consider the number obtained by B
adding the product of elements of A to the
product of elements of B. Let N be the largest 
prime number among these numbers. Find the  
P
sum of the digits of N. 
Answer (17)
Sol. As A, B are partitions of E, so A  B =  D
C
Let product of elements of A be p1 and that of Area of quadrilateral ABCD
B be p2.
 = [APB] + [BPC] + [CPD] + [DPA]
where p .p = 5.6.7.8.9
1 2
1 1 1 1
∵ p1 + p2 is prime number N. = absin   bcsin   cd sin   da sin 
2 2 2 2
so if 6 A then 8, 9 A  will be maximum when  =  =  =  = 90°
So possible combinations of p1 and p2 are 1
max  (a  c) (b  d)
(6, 8, 9), (5, 7) or (6, 8, 9, 5), (7) or (6, 8, 9, 7), (5) 2
The value of N may be 467 or 2167 or 3029 but Also ac = bd (cyclic quadrilateral)
2167 and 3029 are not prime. So N = 467. As {a, b, c, d} = {3, 4, 6, 8}
22. What is the greatest integer not exceeding the  {(a, c), (b, d)} = {(3, 8), (4, 6)}
1599 1
sum n  1 n
? 1
So; max  11  10  55
2
Answer (78) 24. A 1 × n rectangle (n  1) is divided into n unit
(1 × 1) squares. Each square of this rectangle
n  n 1 n1 n
Sol.  n is coloured red, blue or green. Let f(n) be the
2 2 number of colourings of the rectangle in which
 2  n1 n   1
n
2  n  n1  there are an even number of red squares. What
is the largest prime factor of f(9)/f(3)? (The
number of red squares can be zero.)
1599
 2  1600  1    n1
1
n
2  1599  0  Answer (37)

 S  (78, 80) Sol.

1600 1 × n rectangle
Again; 
n2
1
n
2  1600  1  78  f(n)  n C0 · 2n  n C2 · 2n2  n C4 · 2n 4  ....

1 1 (2  1)n  (2  1)n 3n  1
So, S = 78 + 1 –  79  f(n)  
1600 40 2 2
Clearly S  (78, 79) f(9) (39  1) / 2 273 1
  272  1 27 703 19 37
 [S] = 78. f(3) (33  1) / 2 27  1

7
 PRMO-2019

25. A village has a circular wall around it, and the Answer (84)
wall has four gates pointing north, south, east
Sol. B H A1 R A2 T
and west. A tree stands outside the village,
16 m north of the north gate, and it can be just Number of ways of derangement of 6 letters
seen appearing on the horizon from a point
48 m east of the south gate. What is the  1 1 1 1 1
diameter, in meters, of the wall that surrounds  6 –  –  
 2 3 4 5 6
the village?
Answer (48) = 265
Number of derangements when A1 takes place
y
Sol. (0, 16 + r)
T 265
of A2 (or A2 takes place of A1)   53
16 5

Number of derangements when A 1 and A 2

r
x
1 1 1
O exchange their places  4  –    9
r  2 3 4

48 Using principle of inclussion – exclussion,

A (48, – r)
Number of derangements
= 265 – 53 – 53 + 9 = 168
But in each derangement A 1 and A 2 are
r  16  r identical, so actual number of ways of
Equation of line AT is y – 16 – r = (x – 0)
48 168
derangements   84
Perpendicular distance from O(0, 0) to line AT 2
is r 28. Let ABC be a triangle with sides 51, 52, 53. Let
 denote the incircle of ABC. Draw tangents
16  r to  which are parallel to the sides of ABC. Let
 r
2 r 1, r 2, r 3 be the inradii of the three corner
 16  2r 
 48   1 triangles so formed. Find the largest integer
 
that does not exceed r1 + r2 + r3.
 r = 24
Answer (15)
 d = 48
Sol.
A
26. Positive integers x, y, z satisfy xy + z = 160.
Compute the smallest possible value of x + yz. a
P1 P2
Answer (50) R1
Q1
Sol. xy + z = 160
b c
Let x + yz =  B C
Q2 R2
 is minimum when x = 26, y = 6, z = 4
∵ All corner triangles are similar with ABC
minimum = 26 + (6 × 4) = 50.
 a   b   c 
27. We will say that a rearrangement of the letters r1  r·  , r2  r·  and r3  r· 
of a word has no fixed letters if, when the  51   52   53 
rearrangement is placed directly below the
a b c 
word, no column has the same letter repeated. r1  r2  r3  r   
For instance, H B R A T A is a rearrangement  51 52 53 
with no fixed letters of B H A R A T. How many ∵ AP1P2 ~ ABC
distinguishable rearrangements with no fixed
letters does B H A R A T have? (The two As are a h1  2r 2r
  1
considered identical.) 51 h1 h1 (where h1 is altitude form A)

8
 PRMO-2019
Now from triangle ABM, by Pythagoras
  1 1 1 
So r1  r2  r3  r 3  2r      r theorem
  h1 h2 h3  
925
 1170 a
   15 4
s 78
29. In a triangle ABC, the median AD (with D on 7 / 2 14
BC) and the angle bisector BE (with E on AC) So, tan   
27 / 4 27
are perpendicular to each other. If AD = 7 and
BE = 9, find the integer nearest to the area of
1
triangle ABC. Now area of triangle ABC   AB  BC  sin2
2
Answer (47)
Sol. Given AD = 7 1 7/2 x
  a  2a  2  
BE = 9 2 a a

A 27
 7  47.25
4
E
90– 7/2 9–x
So, nearest area = 47
a M N
x
30. Let E denote the set of all natural numbers n

 90 –  7/2 such that 3 < n < 100 and the set (1, 2, 3,..., n)
C can be partitioned into 3 subsets with equal
B a D a
sums. Find the number of elements of E.
In ABD
Answer (64)
BM is angle bisector so
n(n  1)
AB AM  7 Sol. Sum of all digits in a set {1, 2, 3,....n) 
 ∵ AM  MD  2  2
BD MD  
AB = BD = a (Let) So for dividing any set into 3 subsets of equal
sum,
Construct DN parallel to BE
n(n + 1) should be multiple of 3
Now AME and ADN are similar,
So ND = 18 – 2x So n  3 + 1

Now BEC and DNC are also similar  n  4, 7, 10, ....., 97

2a a 27 Total number of possible values of n

So  x
9 18  2x 4 = 96 – 32 = 64

‰ ‰ ‰