SUMMER WORKSHOP-2020

NATIONAL MATHS TALENT CONTEST (NMTC/PRE-RMO)

CLASS -IX & X(JUNIOR GROUP)
COURSE PROGRESS TEST(CPT-1)_ONLINE
Time : 120 Min. Date : 28-06-2020 Max. Marks : 60

GENERAL 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 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 PROM 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 5 carry 2 marks each: Questions 6 to 15 carry 3 marks each: Questions 16 to 19 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.

HEAD OFFICE
Address : Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA,
Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.pccp.resonance.ac.in E-mail : pccp@resonance.ac.in
 ®

1. The integer n is the smallest positive multiple of 15 such that every digit of n is either 8 or 0. Compute

n/120.

2. If m = 31302928  1 . Find the last two digit of m.

3. The digits of a positive integer n are four consecutive integers in decreasing order when read from left to

right. If S is the sum of the possible remainders when n is divided by 37 then find last two digit of S

4. Find the value of a2 + a4 + a6 + a8 + … + a98 if a1 , a2 , a3 … is an arithmetic progression with common

difference 1, and a1 + a2 + a3 + …+ a98 = 137.

5. If a < b < c < d < e are consecutive positive integers such that b + c + d is a perfect square and a + b + c

+ d + e is a perfect cube, what is the sum of digit of smallest possible value of c ?

6. Let an equal 6n + 8n. Determine the remainder upon dividing a83 by 49.

7. Find last two digit of 3x2y2. If x and y are integers such that y2 + 3x2y2 = 30x2 + 517.

8. Let E(n) denote the sum of the even digits of n. For example, E(1243) = 2 + 4 = 6. If the value of E(1) +

E(2) + E(3) + …….. + E(100) is k. Find the digits of k ?

9. If the integer k is added to each of the numbers 36 , 300 and 596, one obtains the squares of three

consecutive terms of an arithmetic series. Find last two digit of k.

10. Given that

(1) x and y are both integers between 100 and 999, inclusive;

(2) y is the number formed by reversing the digits of x ; and

(3) z = | x –y |

How many distinct values of z are possible?

11. If S is the sum of all positive two-digit integers that are divisible by each of their digits. Then find sum of

digit of S

1 1 2
12. Three nonzero real numbers a, b, c are said to be in harmonic progression if + = . Find how many
a c b

pairs of harmonic progressions of a, b, c of strictly increasing positive integers are possible in which

a = 20 and b divides c.

13. Find the sum of digit of least positive integer such that when its leftmost digit is deleted, the resulting

1
integer is of the original integer.
29

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)- 324005
®
Website : www.pccp.resonance.ac.in | E-mail : pccp@resonance.ac.in CPT-1( NMTC/PRE-RMO) _ JUNIOR

Toll Free : | 1800 258 5555 | CIN: U80302RJ2007PLC024029 CLASS-IX& X_PAGE-2

 ®

14. The pages of a book are numbered 1 through n. When the page numbers of the book were added, one of

the page numbers was mistakenly added twice, resulting in an incorrect sum of 1986. What was the

number of the page that was added twice?

15. For positive real numbers x and y, define their special mean to be average of their arithmetic and

geometric means. If the total number of pairs of integers (x, y), with x

…..,2016), such that the special mean of x and y is a perfect square is k. Find the sum of digits of k.

16. In a parlor game, the magician asks one of the participants to think of a three digit number (abc) where a,

b, and c represent digits in base 10 in the order indicated. The magician then asks this person to form the

numbers (acb), (bca), (bac), (cab), and (cba), to add these five numbers, and to reveal their sum, N. If

told the value of N, the magician can identify the original number, (abc). Play the role of the magician and

determine the value of (abc) if N = 3194 for a three digit number abc then find (a)(b)+c

17. Find the product of digit of smallest positive integer whose cube ends in 888.

18. By a proper divisor of a natural number we mean a positive integral divisor other than 1 and the number

itself. A natural number greater than 1 will be called nice if it is equal to the product of its distinct proper

divisors. What is the last two digit of sum of the first ten nice numbers?

19. Given the sequence a, ab, aab, aabb, aaabb,aaabbb, ..... upto 2004 terms, if the sum of total number of

times a’s and b’s are used from 1 to 2004 terms is k . Find the unit digit of k :

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)- 324005
®
Website : www.pccp.resonance.ac.in | E-mail : pccp@resonance.ac.in CPT-1( NMTC/PRE-RMO) _ JUNIOR

Toll Free : | 1800 258 5555 | CIN: U80302RJ2007PLC024029 CLASS-IX& X_PAGE-3

®

Space for Rough Work

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)- 324005
®
Website : www.pccp.resonance.ac.in | E-mail : pccp@resonance.ac.in CPT-1( NMTC/PRE-RMO) _ JUNIOR

Toll Free : | 1800 258 5555 | CIN: U80302RJ2007PLC024029 CLASS-IX& X_PAGE-4

 ANSWER KEY
CLASS – IX & X NMTC/PRE-RMO CPT-1ONLINE
Ques. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Ans. 74 69 17 93 18 35 88 04 25 09 09 05 14 33 11
Ques. 16 17 18 19
Ans. 23 18 82 08

HINTS & SOLUTIONS

1. Any multiple of 15 is a multiple of 5 and a multiple of 3.
Any multiple of 5 ends in 0 or 5; since n only contains the digits 0 and 8, the units digit of n must be 0.
The sum of the digits of any multiple of 3 must be divisible by 3. If n has digits equal to 8, the sum of
the digits of n is 8a. For this number to be divisible by 3, must be divisible by 3. We also k now that a
> 0 since n is positive. Thus must have at least three copies of the digit 8.
The smallest number which meets these two requirements is 8880. Thus the answer is 8880/120=74.
2. Let's call our four consecutive integers n – 1,n, n  1, n  2 .

  
Notice that n – 1nn  1n  2  1 = n2  n – 2 n2  n  1  n2  n – 1 .
2
   2

Thus, 31302928  1 =
 29 – 1 = 869. 29 2

3. A brute-force solution to this question is fairly quick, but we'll try something slightly more clever: our
numbers have the form n  3n  2n  1n
1000n  3  100n  2  10n  1  n  3210  1111n , for n  {0 , 1 , 2 , 3 , 4 , 5 , 6}.
=
Now, note that 3  37 = 111 so 30  37 = 1110, and 90  37 = 3330 so 87  37 = 3219. So the
remainders are all congruent to n – 9 (mod 37). However, these numbers are negative for our choices
of n , so in fact the remainders must equal n + 28.
Adding these numbers up, we get 0  1 2  3  4  5  6  7  28 = 217 , our answer.
4. One approach to this problem is to apply the formula for the sum of an arithmetic series in order to find
the value of a1, then use that to calculate a2 and sum another arithmetic series to get our answer.
A somewhat quicker method is to do the following: for each n  1, we have a2n–1 = a2n – 1. We can
substitute this into our given equation to get a2 – 1  a2  a4 – 1  a4  ...  a98 – 1  a98  137 . The
137  49
left-hand side of this equation is simply 2a2  a4  ...  a98  – 49 , so our desired value is =
2
093.
5. Since the middle term of an arithmetic progression with an odd number of terms is the average of the
series, we know b + c + d = 3c and a + b + c + d + e = 5c. Thus, must be in the form of 3  x2 based
upon the first part and in the form of 5 2  y 3 based upon the second part, with x and y denoting an
integers. c is minimized if it’s prime factorization contains only 3 , 5 and since there is a cubed term in
52  y 3 ,33 must be a factor of c. 3352 = 675, which works as the solution
6. First, we try to find a relationship between the numbers we're provided with and 49. We realize that 49
= 72 and both 6 and 8 are greater or less than 7 by 1.
Expressing the numbers in terms of 7, we get 7  183  7  183 .
Applying the Binomial Theorem, half of our terms cancel out and we are left
 
with 2 783  3403  781  ...  83  7 . We realize that all of these terms are divisible by 49 except the final
term. After some quick division, our answer is 035.
7. If we move the x2 term to the left side, it is factorable:
(3x2 + 1)(y2 – 10) = 517 – 10. 507 is equal to 3 * 132. Since x and y are integers, 3x2 + 1cannot equal a
multiple of three. 169 doesn't work either, so 3x2 + 1 = 13, and x = ± 2. This leaves y2 – 10 = 39, so y =
±7. Thus, 3x2y2 = 3 × 4 × 49 = 588.
Its last two digit is 88
8. (2 + 4 + 6 + 8) + (2 + 4 + 6 + 8) + (2 + 4 + 6 + 8) + ....... (10 times) = 2 × 10 + 4 × 10 + ..... 8× 10
200 + 10 (2 + 4 = 6 + 8)
200 + 200 = 400.

Reg. & Corp 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 CLASS-VI
Toll Free: 1800 258 5555 | CIN: U80302RJ2007PLC024029 RESO NET _ SOL_PAGE-1
Pre-foundation Career Care Programmes (PCCP) Division
9. Call the terms of the arithmetic progression a , a + d , a + 2d making their squares a2 , a2 + 2ad + d2 , a2
+ 4ad + 4d2.
We know that a2 = 36 + k and (a + d)2 = 300 + k, and subtracting these two we get 264 = 2ad + d 2(1).
Similarly, using (a + d)2 = 300 + k and (a + 2d)2 = 596 + k, subtraction yields 296 = 2ad + 3d2(2).
Subtracting the first equation from the second, we get 2d2 = 32, so d = 4. Substituting backwards yields
that a = 31 and k = 925.
10. We express the numbers as x = 100a + 10b + c and y = 100c + 10b + a. From this, we have
Z = |100a + 10b + c – 100c – 10b – a| = |99a – 99c| = 99 |a – c|
Because a and c are digits, and a is between 1 and 9, there are 9. possible values.
11. Let our number be 10a + b , a , b  0. Then we have two conditions: 10a + b 10a 0 (mod b) and 10a
+ b b (mod a), or a divides into b and b divides into 10 a. Thus b = a , 2a or 5s (note that if b = 10a,
then b would not be a digit).
910
For b = a, we have n = 11a for nine possibilities, giving us a sum of 11 = 495.
2
For b = a, we have n = 12a for four possibilities (the higher ones give b > 9), giving us a sum of
45 
12  = 120.
2
For b = 5a , we have n = 15a for one possibility (again, higher ones give b > 9), giving us a sum of 15.
If we ignore the case b = 0 as we have been doing so far, then the sum is 495 + 120 + 15 = 630.
Using casework, we can list out all of these numbers: 11 + 12 + 15 + 22 + 24 + 33 + 36 + 44 + 48 + 55
+ 66 + 77 + 88 + 99 = 630.
1 1 2
12. Since 20, b, c are in harmonic progression, we have + = , which reduces to bc + 20b – 40c = 0.
20 c b
This may also be written in the form (40 – b) (c + 20) = 800.
Thus we must have 20 < b < 40 or, equivalently, 0 < 40 – b < 20. Let us consider the factorisation of
800 in which one term is less than 20: (40 – b) (c + 20) = 800 = 1 × 800 = 2 × 400 = 4 × 200
= 5 × 160 = 8 × 100 = 10 × 80 = 16 × 50. We thus get the pairs (b, c) = (39, 780), (38, 380), (36, 180),
(35, 140), (32, 80), (30, 60), (24, 30).
Among these 7 pairs, we see that only 5 pairs (39, 780), (38, 380), (36, 180), (135, 140), (30, 60) fulfill
the condition of divisibility : b divides C. Thus there are 5 triples satisfying the requirement of the
problem.
13. Suppose the original number is N = anan–1...a1a0 where the ai are digits and the first digit, an , is
nonzero. Then the number we create is N 0 = an –1...a1a 0 , so N = 29 N0 , But N is N0 with the digit an
added to the left, so N = N0 + an  10n . Thus, N0 + an  10n = 29N0 an  10n = 28N0. The right-hand side of
this equation is divisible by seven, so the left-hand side must also be divisible by seven. The number
10n is never divisible by 7 , so an must be divisible by 7. But an is a nonzero digit, so the only possibility
is an = 7.This gives 7  10n = 28N0 or 10n = 4N0. Now, we want to minimize both n and N0 , so we take N0
= 25 and n = 2. Then N = 7  102 + 25 = 725 , and indeed, 725 = 29  25 .
nn  1
14. Denote the page number as x, with x < n. The sum formula shows that  x  1986 . Since x
2
nn  1
cannot be very large, disregard it for now and solve  1986 . The positive root for
2
n  3972  63 . Quickly testing, we find that 63 is too large, but if we plug in 62 we find that our
6263
answer is + x = 1986  x = 033.
2
xy
 xy  x y
2

15. Special mean = 2 =  

2  2 
 
If x = 1, then possible values of y is every odd positive perfect square number less than 2016.
So possible values of y = 22.
if x = 4, then possible values of y = 22 {every even 2  y 44}
if x = 9, then possible values of y = 21 {every odd 3  y  44}
So, possible cases are = 22 + 22 + 21 + 21 + 20 + 20 + ......... + 1 + 1 = 506.

Reg. & Corp 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 CLASS-VI
Toll Free: 1800 258 5555 | CIN: U80302RJ2007PLC024029 RESO NET _ SOL_PAGE-2
Pre-foundation Career Care Programmes (PCCP) Division
16. Let m be the number 100a + 10b + c. Observe that 3194 + m = 222 (a +b + c) so
m  – 3194  – 86  136 (mod 222)
3194  m 3194
This reduces m to one of 136, 358, 580, 802. But also a + b + c =   14 so a + b + c 
222 222
15. Only one of the values of m satisfies this, namely 358.
So 3 x 5 + 8 = 23
17. A little bit of checking tells us that the units digit must be 2. Now our cube must be in the form of (10k +
2)3; using the binomial theorem gives us 1000k3 + 600k2 + 120k + 8. Since we are looking for the tens
digit, mod 100 we get 20k + 8 88 (mod 100). This is true if the tens digit is either 4 or 9. Casework:
4: Then our cube must be in the form of (100k + 42) 3  3(100k)(42)3 200k + 8 (mod 1000). Hence the
lowest possible value for the hundreds digit is 4, and so 442 is a valid solution.
9: Then our cube is (100k + 92)3  3(100k)(92)2 + 923  200k + 688 (mod 1000). The lowest
possible value for the hundreds digit is 1, and we get 192, which is our minimum.
The answer is 192.
18. Let p(n) denote the product of the distinct proper divisors of n. A number n is nice in one of two
instances:
1. It has exactly two distinct prime divisors.
If we let n = pq, where p ,q are the prime factors, then its proper divisors are p and q, and p(n) = p  q =
n.
2. It is the cube of a prime number.
If we let n = p3 with p prime, then its proper divisors are p and p2, and p(n) = p  p2 = n.
We now show that the above are the only two cases. Suppose that another nice number existed that
does not fall into one of these two categories. Then we can either express it in the form n = pqr (with p ,
q prime and r > 1) or n = pe (with e  3).
In the former case, it suffices to note that p(n)  (pr)  (qr) = pqr2 > pqr = n. In the latter case, then p(n) =
1  p p2 ….pe = pe(e + 1)/2. For p(n) = n, we need pe(e + 1)/2 = pe  e2 + e = 2e  e = 0 , 3 (the case e = 0
 n = 1 does not work).
Thus, listing out the first ten numbers to fit this form, 2 3 = 6 , 2 3 = 8 , 2 5 = 10 , 2 7 = 14 , 3 5 = 15
, 3 7 = 21, 2 11 = 22 , 2 13 = 26 , 33 = 27 , 3 11 = 33. Summing these yields 182.
19. Looking at the terms of the sequence given, it can be noted that all even members have the same
number of a’ s and b’s while, all odd members have one ‘a’ more than the b’s. Further in the n th
n
member, if n is even the number of a’s = the number of b’s = and if n is odd, the number of a’s =
2
n 1 n –1
, while the number of b’s = .
2 2
As 2004th member of the sequence corresponds to an even number 2004, the number of a’s and the
number of b’s in this member will both be equal to 1002. As 2003 is odd, the number of a’s in the 2003 rd
2003 1 2003 – 1
member is or 1002 while the number of b’s will be = 1001.
2 2
  Number of a’s in the first 2004 members = 1 + 1 + 2 + 2 + 3 + 3 …+ 1002 + 1002
2  1002 1003
= 2(1 + 2 + …+1002) = = 1002 × 1003.
2
Also number of b’s in the first 2004 numbers = 0 + 1 + 1 + 1 + 2 + 2 + 3 + 3 + 4 + …+ 1001 + 1002
2  1001 1002
= 2[1 + 2 + …+ 1001] + 1002 = + 1002
2
= 1002 × (1001 + 1) = 10022
Sum = 1002 × 1003 + 10022 = 1002 × 1004
unit digit of sum of a's and b's is 08.

Reg. & Corp 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 CLASS-VI
Toll Free: 1800 258 5555 | CIN: U80302RJ2007PLC024029 RESO NET _ SOL_PAGE-3
Pre-foundation Career Care Programmes (PCCP) Division