TEST PAPER

PRE RMO (CLASS – IX & X)

Date: 276th May, 2019 | Duration: 3 Hours

INSTRUCTION
Number of Questions : 30 Max. Marks : 102

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 machine through scanning. On OMR sheet, darken bubbles completely
with a black pencil or a black blue pen. Darken the bubbles completely only after you are sure of
your answer : else, erasing 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 PROME score.
4. Incomplete /incorrectly and 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 bubble with detailed instructions. The second diagram shows how
to mark a 2–digit number and a 1–digit number.

6. The answer you write on OMR sheet is irrelevant. The darken 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 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 further
for verification purposes.
13. You may take away the question paper after the examination.
 Pre RMO (Class-IX & X)_27-06-2019

Questions 1 to 6 carry 2 marks each :

2000 2004
1. The sum of the digits of the number 2 5 is ….
9
2. Find the number of all the positive perfect cubes that divide 9 .
5555 3333 2222 BBBB
3. The larger number among 2 ,3 ,6 is A then find the value of A + B (A and B may be
same)
2 2
4. (123456) + 123456 + 123457=A then find the sum of digit of A

5. P is the greatest number of four digits which when increased by 1 is exactly divisible by 2, 3, 4, 5,
6 and 7.Find the sum of digit of P.
2
6. How many pairs of integers (m, n) are there such that mn + n + 14 = (m – 1) ?

Questions 7 to 21 carry 3 marks each :

2 n+2
7. Find the number of integers n such that (n –n–1) =1
2
8. For how many integers n, there are four distinct real numbers satisfying the equation |x – 4x – 7| = n ?

9. The odd positive integers 1, 3, 5, 7….. are arranged in five columns(C1, C2, C3, C4 and C5)
continuing with the pattern shown on the right. Counting from the left, if 2005 will come in column
CA then find the value of A
C1 C2 C3 C4 C5
1 3 5 7
15 13 11 9
17 19 21 23
31 29 27 25
33 35 37 39
47 45 43 41
49 51 53 55
. . . .
. . . .
. . . .
3 3 k
10. How many non-negative integer triples (m, n, k) are there such that m – n = 9 + 123 ?
3 3
11. For how many different primes p, there exists an integer n such that p|n + 3 and p |n + 5 ?
4
12. Let f(n) be the smallest prime which divides n + 1. What is the remainder when the sum
f(1) + f(2) + ...... + f(2014) is divided by 8 ?

13. N is the smallest multiple of ‘15’ such that each digit of the multiple is either ‘0’ or ‘8’. Find the sum
of digit of N.

14. At the end of year 2002. Ram was half as old as his grandfather. The sum of years in which they
were born is 3854. What is the age of Ram in years at the end of year 2003?

1 2013 n
15. How many triples (p, q, n) are there such that   where p, q are prime numbers
p q 5
and n is a positive integer?

16. If the remainder is 2013 when a polynomial with coefficients from the set {0, 1, 2, 3, 4, 5} is divided
by x – 6, what is the least possible value of the coefficient of x in this polynomial?

Corporate Office : CG Tower, A–46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)– 324005
Website : www.resonance.ac.in | E–mail : contact@resonance.ac.in
PRMO26/06/19–2
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
 Pre RMO (Class-IX & X)_27-06-2019

(x  2y)
17. If 2x = 3y = 12 then find value of
xy
th
18. Find the sum of digit of the 111 smallest positive integer which does not have 3 and 4 in its base-
5 representation?

19. There is a prime number p such that 16p + 1 is the cube of a positive integer. Find the sum of digit
of p.

2( 2  6) A B C
20. If  2 3  2– 3 = , where A, B, C all are positive integers then find
3 2 3 B
A+B+C

m
21. Let m be the least positive integer divisible by 17 whose digits sum to 17. Find .
14

Questions 22 to 30 carry 5 marks each.

22. Five houses P, Q, R, S and T are situated on the opposite side of a street from five other houses
U, V, W, X and Y as shown in the diagram :
P Q R S T

20m
20m

U V W X Y
Houses on the same side of the street are 20 metres apart A postman is trying to decide whether
to deliver the letters using route PQRSTYXWVU or route PUQVRWSXTY, and finds that the total
distance is the same in each case. If the total distance is P metres then find the sum of digit of P.

23. How many distinct sets are there such that each set contains only non-negative powers
of 2 or 3 and sum of its elements is 2014 ?

24. Let x and y be two 2–digit numbers such that y is obtained by reversing the digits of x. Suppose
they also satisfy x2 – y2 = m2 for some positive integer m. The value of x + m is.

25. The number of 6–digit numbers of the form ababab (in base 10) each of which is a product of
exactly 6 distinct primes is

26. The number of all 3–digit numbers abc (in base10) for which
(a × b × c) + (a × b) + (b c)+ (c × a) + a + b + c = 29 is.

27. The number of integers a, b, c for which a2 + b2 – 2016c = 2019 is

28. N = P1P2P3 and P1, P2 and P3 are distinct prime numbers. If d1, d2.......di are divisors of N and
i i

 d  3N , find 
1
i .
i 1 i 1
di

n–1 n n
29. N=2 (2 – 1) and (2 – 1) is a prime number 1 < d1 < d2 < ........ < dk = N are the divisors of N.
1 1 1 1
Find    ...... 
1 d1 d2 dk
11 12 2006
30. Find sum of the last three digits of 2005 + 2005 + … + 2005 .

Corporate Office : CG Tower, A–46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)– 324005
Website : www.resonance.ac.in | E–mail : contact@resonance.ac.in
PRMO26/06/19–3
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
 Pre RMO (Class-IX & X)_27-06-2019

Space for rough work

Corporate Office : CG Tower, A–46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)– 324005
Website : www.resonance.ac.in | E–mail : contact@resonance.ac.in
PRMO26/06/19–4
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
 Pre RMO (Class-IX & X)_27-06-2019

TEST PAPER
PRE RMO (CLASS – IX & X) Date: 27th May, 2019
ANSWER KEY

1. 13 2. 10 3. 08 4. 22 5. 29

6. 08 7. 04 8. 10 9. 04 10. 01

11. 02 12. 05 13. 24 14. 51 15. 07

16. 05 17. 01 18. 17 19. 10 20. 13

21. 34 22. 13 23. 64 24. 98 25. 13

26. 14 27. 00 28. 03 29. 02 30. 05

SOLUTIONS
2000 2004 2000 4
1. 2 5 = (2 x 5) x 5 = 625000…..(2000 zeroes)
So sum of digits is 6 + 2 + 5 = 13
9 3 9 27
2. 9 = (3 ) = (3)
9
The positive perfect cubes that divide 9 are :
3 3 2 3 3 3 4 3 5 3 6 3 7 3 8 3 9 3
1 , 3 , (3 ) , (3 ) , (3 ) , (3 ) , (3 ) , (3 ) , (3 ) , (3 ) .
i.e. 10 numbers
5555 3333 2222
3. 2 ,3 ,6
5
2 = 32
3
3 = 27
2
6 = 36
 33< 25< 62
 33333 < 25555 < 62222
 The required order of the three numbers is :–
3333 5555 2222 2222 BBBB
3 , 2 , 6 so the larger number is 6 =A , so A=6 and B=2 so A+B=6+2=8
2 2 2 2
4. (123456) + 123456 + 123457=(123456) + 123456 + 123456 +1=(123456) + 2x123456x1 + (1)
2 2
=(123456+1) = (123457)

5. First
L.C.M. of 2, 3, 4, 5, 6, and 7 = 420
Now the largest four – digit multiple of 420 is :–
420 x 23 = 9660
 The req. number is = 9660 – 1 = 9659 = P
Sum of digit = 9 + 6 + 5 + 9 = 29

6.

,
so
Corporate Office : CG Tower, A–46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)– 324005
Website : www.resonance.ac.in | E–mail : contact@resonance.ac.in
PRMO26/06/19–5
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
 Pre RMO (Class-IX & X)_27-06-2019

Finally 0 solutions.

 (n –n–1) n –n–1 =1
2 n+2 2 n+2 n+2 2
7. (n –n–1) =1 = (1)
n –n–2 =0  n – 2n + n – 2 = 0  n (n – 2) + 1 (n – 2) = 0
2 2

 (n – 2) (n + 1) = 0
n = 2 or –1
n+2=0  n=–2
2
n –n–1=–1
n = 0, 1.
here, if we put n = 0, then the power n + 2 becomes even.
But if we put n = 1, then the power n + 2 becomes odd
so, we will not consider n = 1
Final solution are n = 2, – 1, – 2, 0.

8. Global minima = 0, local maxima = 11, so ,.

9. I II III IV V
1 3 5 7
15 13 11 9
17 19 21 23
31 29 27 25
33 35 37 39
47 45 43 41
. . . .
. . . .
. . . .

In column I :
15 = 16 x 1 – 1 = 16k – 1
31 = 16 x 2 – 1 = 16k – 1
47 = 16 x 3 – 1 = 16k – 1
But, 2005 16K–1 for any integer K
  2005 is not in column I.
In column II :–
1 = 16 x 0 + 1 = 16k + 1
13 = 16 x 1 –3 = 16k – 3
17 = 16 x 1 + 1 = 16k + 1
29 = 16 x 2 –3 = 16k –3
But, 2005  16k + 1
2005  16k – 3
  2005 is not a column II,
In column III :–
3 = 16 x 0 + 3 = 16k + 3
11 = 16 x 1 –5 = 16k – 5
19 = 16 x 1 + 3 = 16k + 3
27 = 16 x 2 –5 = 16k –5
But, 2005  16k + 3
2005  16k – 5
for any integer k.
  2005 dosen’t occur in column III,
In column IV :–
5 = 16 x 0 + 5 = 16k + 5
9 = 16 x 1 –7 = 16k – 7
21 = 16 x 1 + 5 = 16k + 5

Corporate Office : CG Tower, A–46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)– 324005
Website : www.resonance.ac.in | E–mail : contact@resonance.ac.in
PRMO26/06/19–6
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
 Pre RMO (Class-IX & X)_27-06-2019

25 = 16 x 2 –7 = 16k –7
But, 2005  16k –7 for any integer k.
But, 16k+ 5 = 2005
For k = 125
  2005 occurs in column IV.
10. It's very well known that .
However if .This is impossible thus and the equation
becomes which has the unique solution .

11. Its easy to see that . So which means

12. Notice that if then . Therefore we only have to check the

residues for to find a pattern. We realize that the pattern is .

Therefore our answer is 5 (mode 8)

13. Smallest multiple of 15, such that each digit of the multiple in either 0 or 8 are
Two & Three digit nos Four digit and Five digit nos
8000
8008
80 8080
880 8800
808 8880
800 80888
80888
88088
So only possibility for multiple of 15 i.e. divisible by 5 is last digit is 0 i.e.
(i) 2 digits 80
(ii) 3 digits 880, 800
(iii) 4 digits 8000, 8800, 8880, 8080
(iv) 5 digit 88880 80000
88800 88000
88080
As 15 = 5x3
So the number should be divisible by 3 the sum of digit should be divisible by 3.
Hence let us analyze the sum of digits in (i), (ii), (iii) and (iv),
(i) 2 digit : not possible
(ii) 3 digit : not possible
(ii) 4 digit : with 888
sum in 8+8+8 = 24
that is divisible by 3
But last digit should be 0 and it should contain three numbers of 8.
N=8880
Sum of digit =8+8+8+0=24

14. Let age of Ram at the end of 2002 = x

so age of his grand father = 2x
so, Ram was born in (2002 – x)
Ram’s grand father was born in (2002–2x)
from question : 2002 – x + 2002 – 2x = 3854
 –3x = – 150  x = 50
So, the age of Ram at the end of 2003 in 51.
Corporate Office : CG Tower, A–46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)– 324005
Website : www.resonance.ac.in | E–mail : contact@resonance.ac.in
PRMO26/06/19–7
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
 Pre RMO (Class-IX & X)_27-06-2019

15. Multiply by to get

Take
If ,

This gives us pairs.

If ,
This gives us four more values. However, note that we have the pair repeat in both our
cases. Therefore, the answer is .

16. Let be the polynomial. We

have . Since and doesnot divide , we have

Again, we must have
1/x
17. 2x = 12 2 = 12
1/y
3y = 12 3 = 12
2 2/x 1/y
12=2 x3 12=(12) (12)
(x  2y)
So by comparing the power we get =1
xy
18. Observe that we are just counting, in increasing order, the set of base 5 numbers that have a base
3 representation, thus the 111st smallest element of this set is
,
so the answer is 755. digit. sum = 17

19. . Note that the second

factor is always odd so all of the factors of 2 must come from , so must be divisible

by 16. Moreover, if is greater than 16, then , which means

that won't be prime, a contradiction.

Therefore, and , and we are done. digit sum = 10.

2( 2  6) 4(8  4 3) 16(2  3)
20. Let =x  x2 =  x2 =
3 2 3 9(2  3) 9(2  3)
16 4
 x2 =  x=
9 3

Let 2 3 = a

2 3 = b
(a + b)2 = a2 + b2 + 2ab

(a + b) = a2  b2  2ab = 2 3 2 3 2 43 = 42 = 6

4 43 6
 + 6 
3 3

21. Let the number be m . Then divides m.

Corporate Office : CG Tower, A–46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)– 324005
Website : www.resonance.ac.in | E–mail : contact@resonance.ac.in
PRMO26/06/19–8
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
 Pre RMO (Class-IX & X)_27-06-2019

Replace with .
m becomes . Ignore the and factor as .
The smallest pair that works is . Thus, and m = 476.
m
= 34
14
Alternate :
must be a multiple of . The digits sum to , or that is . The first multiple of
17 is , so this is a good head start. To retain the , only multiples
of can be added. The first few numbers are
. Since this is asking for the minimum , the answer
is .
digit sum = 34

22.
P Q R S T

U V W X Y
Let, PV = QW = RX = SY = TX
= SW = RV = QU = x
and PU = TY = y
 In case of route P Q R S T Y X W V U,
Total Distance = PQ + QR + RS + ST + TY + YX + XW + WV + VU
= 20 + 20 + 20 + 20 + y + 20 + 20 + 20 + 20
= 160 + y
In case of route P U Q V R W S X T Y,
Total Distance = PU + UQ + QV + VR + RW + WS + SX + XT + TY
= y + x + y + x + y + x + y + x + y = 4x + 5y
given,
160 + y = 4x + 5y
 160 = 4x + 4y
 x + y = 40 (i)
Considering PUV
P

x
y

U V
20
By Pythagoras theorem,
2 2 2
x –y = 20
400
 (x+y) (x–y) = 400  x+y=
xy
10
400
 40 = [ x + y = 10 from (i)]
xy
 x – y = 10 (ii)
x + y = 40
x – y = 10
– + –
Corporate Office : CG Tower, A–46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)– 324005
Website : www.resonance.ac.in | E–mail : contact@resonance.ac.in
PRMO26/06/19–9
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
 Pre RMO (Class-IX & X)_27-06-2019

2y = 30
 y = 15
Total distance = 160 + y
= 160 + 15 = 175 m

23. We can write powers of (including ) as in the form

where . Let .
When we choose the digits of , will be automatically constructed. Normally, without a
constraint, there are different s. But there may be some s which could not form appropriate
sets. e.g, when , since is odd, should be odd. In that
case, . Since we used for , the ones digit of in base cannot
be . When , to get an odd ,the sequence should contain even
number of .

Since , there are different s in that form.

When , since is even, should be even. In that case,

and .
Since , to get an event ,the sequence should contain even numbers
of . We've just showed that there are different s in that form.
When , and the sequence contains odd number
of . Since is odd, is odd. So . No problem, since we didn't use in
base representation of . There are different permutations of which contain
even number of s. So there are permutations for odd number of s.
When , and the sequence contains odd number
of . is even because is even. So . There isn't any problem for ones digit; but there is
another problem. If , then .The ones digit of in
base is and the ones digit of in base is . So and contain
same digits except the ones digit. Similarly, and contain same digit except the ones
digit. So the set from pair and the set from pair will be equal.
Since and , for each
possible s, there should be an for every .

In total, there are different sets.

Alternate :
Notice how we can write any number as a unique sum of distinct powers of 2.
Therefore, it is enough to calculate how many subsets of powers of 3 (excluding 1) have the sum
lower or equal to 2014.
Powers of 3: 3, 9, 27, 81, 243, 729
Powers after 729 are meaningless since they are greater than 2014.
Since the sum of all the powers is less than 2014, the solution is the number of subsets, or 2^6 =
64

24. X  ab or x = 10 a + b
y ba or y = 10 b + a
Now x2 – y2 = (10a +b)2 – (10 b + a)2
= 99 (a2 – b2)
= 32 x 11(a + b) (a – b) –––––– (1)
According of Q
(a + b)(a – b) = 11 and a – b = 1
Corporate Office : CG Tower, A–46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)– 324005
Website : www.resonance.ac.in | E–mail : contact@resonance.ac.in
PRMO26/06/19–10
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
 Pre RMO (Class-IX & X)_27-06-2019

 a + b = 11 and a – b = 1
 a = 6, b = 5
Hence
x = 65
y = 56 and m = 33 x + m = 98
25. N = ab ab ab
1< a  9 0<b9 a, b  I
N = 105a + 104b + 103 a + 102b + 10a + b
= (10 + 10 + 1) (10a + b)  (102  10  1)(102  10  1) (10a  b)
4 2

 3  37  13  7(10a  b) ......... (1)

then 10a + b = P1 × P2 p1,p2  prime and 10  10a  b  99
a b 10a + b
1 0 10 = 2 × 5
2 2 22 = 2 × 11
3 4 34 = 2 × 17
3 8 38 = 2 × 19
4 6 46 = 2 × 23
5 5 55 = 5 × 11
5 8 58 = 2 × 29
6 2 62 = 2 × 31
7 4 74 = 2 × 37
8 2 82 = 2 × 41
8 5 85 = 5 × 17
9 4 94 = 2 × 47
9 5 95 = 5 × 19
Total = 13 numbers

26. abc + ab + bc + ca + a + b + c = 29
ab (c + 1) +b (c + 1) + a(c + 1) + c + 1 = 30
(a + 1) (b +1) (c+1) = 30
2x3x5=30 so value of a,b,c are 1,2,4 which can be arranged in 3!=6
6x5x1=30 so value of a,b,c are 5,4,0 which can be arranged in 2!=4
10x3x1=30 so value of a,b,c are 9,3,0 which can be arranged in 2!=4
Then no of sol. = 14

27. a2 + b2 – 2016c = 2019 .......(1)

We know that perfect square of any positive integer is in the form of 4n or 4n + 1
Case – I : a2 = 4n1 and b2 = 4n2
then put in (1)
4n1 + 4n2 – 2016c = 2019
when we divide LHS by 4
we get rem = 0
but on RHS we get rem = 3
LHS  RHS.
Case – II : If a2 = 4n1 + 1 and b = 4n2
then, again put in equation (1)
4n1 + 1 + 4n2 – 2016c = 2019
Divide the above equation by 4.
On LHS, we will get rem. 1 but on RHS, we wll get 3.
 LHS RHS.
Case– III : If a2 = 4n1 + 1 and b2 = 4n2 + 1
then put in equation (1)
4n1 + 1 + 4n2 + 1 – 2016c = 2019
Corporate Office : CG Tower, A–46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)– 324005
Website : www.resonance.ac.in | E–mail : contact@resonance.ac.in
PRMO26/06/19–11
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
 Pre RMO (Class-IX & X)_27-06-2019

divide by 4.
On LHS, we will get rem = 2
On RHS, we will get rem = 3
 LHS  RHS
Hence there are no possible value of a, b, c.
28. The divisors of N are 1, P1, P2, P3, P1 P2, P2 P3, P1P2P3
It is given that 1 + P1 + P2 + P3 + P1P2 + P2P3 + P1P2P3 = 3N
i


1 1 1 1 1 1 1 1 1
Now =       
i 1
di 1 P1 P2 P3 P1P2 P1P3 P2P3 P1P2P3
P1P2P3  P2P3  P1P3  P1P2  P3  P2  P1  1
=
P1P2P3
But the numerator is the sum of the divisors of N,
i i

 
1 3P1P2P3
i.e., di  3N = 3P1P2P3 and hence, = =3
i 1 i 1
di P1P2P3

n .
29. Let 2 – 1=q
2 n–1 n–1
We already saw that 1, d1, d2,......., dk are 1, 2, 2 , ..........., 2 , q, 2q, .........., 2 q, respectively
1 1 1 1
So, S=    ...... 
1 d1 d2 dk
1 1 1 1 1 1 1 1 1 
=   2  ......  n 1  ×    2  ......  n 1 
1 2 2 2 q 1 2 2 2 
2n  1 1 (2n  1) (2n  1)q  (2n  1)
 S=  =
2n1 q 2n1 q2n1
(2n  1)(q  1) (2n  1)(2n ) 2n
= n1
= n 1
= = 2.
q2 (2  1) (2
n
) 2n  1

30. Finding last n digits of a number is done by finding the remainder when given number is divided by
3
10 .
We note that 2005 ≡ 5 (mod 1000), so the sum is congruent to
11 12 2006
5 +5 +…+5 (mod 1000),
4
We have 5 = 625 and 5 . 625 ≡ 125 (mod 1000), but 5 . 125 = 625, so powers of 5 modulo 1000
n
repeat periodically 625, 125, 625, 125, … that is to say 5 ≡ 625
m
(mod 1000) for even n ≥ 4 and 5 ≡ 125 (mod 1000) for odd m ≥ 5. So we can write
the sum as
11 12 2005
5 +5 +…+5
 125  625  125  .......  125  625 (mod 1000),
1996 terms

Now, 125  625  125  .......  125  625 = 998 · 625 + 998 · 125 = 998 · 750=748500
1996 terms

Thus the sum is congruent to

998 . 750 ≡ ( –2 )(–250) ≡ 500 (mod 1000).

Corporate Office : CG Tower, A–46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)– 324005
Website : www.resonance.ac.in | E–mail : contact@resonance.ac.in
PRMO26/06/19–12
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029