SECTION: CO-IIT ADVANCE IOQM Date: 19-02-2024

Time: 90 Mns. PRACTICE TEST-03 Marks: 50

KEY
KEY
Q.No. 01 02 03 04 05 06 07 08 09 10
Ans. 03 63 03 98 72 14 72 05 07 09
Q.No. 11 12 13 14 15
Ans. 24 67 12 03 29

1. There are four intervals to consider, each with their own restrictions. Consider
the case in which x  2. Then the equation becomes

 x  1  x 2  2  2  x  x  2  x  1  0 . Thus, x  2 is the only rational root for

x  2 . Consider the case in which  2  x  1 . Then the equation becomes

 x  1  x 2  2  2  x  x  2  x  1  0 . Thus, x  0 and x   1 are the rational roots

for  2  x  1 . Consider the case in which x   2 or the case in which

1 x  2. In these cases, the equation becomes

1  x   x 2  2   2   x 3  x 2  2x  4 . By the rational root theorem, the rational

roots of this polynomial can only be 4, 2, 1 and a quick check shows that
none of these are roots, so this polynomial has no rational roots.
2. This amounts to determining, for a given numerator, how many elements in S
are relatively prime to the numerator. If we let f  n  be the number of positive
integers relatively prime to n and less than or equal to 10, it is obvious that
f 1  10, f  2  f  4   f  8   5, f  5   8, f  7   9 , f  6  3 , and f 10   4 .

Therefore, the answer is 10  3  5  2  7  8  9  3  4  63 .

Corporate Office: 10th Floor, Melange Tower; No.80-84, Pathrika Nagar; Hitech-City, Madhapur, Hyderabad.
Telangana - 500 081.
Toll Free: 1800-102-3344 : info@narayangaroup.com : http://www.narayanagroup.com
 CLASS 8th & 9th ADV IOQM PRACTICE TEST-3_Dt.19-02-2024

3. For b  0 one has 2a  1  c 2,2a  c  1  c  1 . Thus both c  1 and c  1 should

be powers of 2. The only possibility is c  3 , which gives a solution 23  30  9

 32 . For b  1,2a  3n is not divisible by 3, so it should be  1 mod 3 . This

requires a to be even. Let a  2d, then 3b  c 2  22d   c  2d  . Let c  2d  2d  3 p

and c  2d  3q . Eliminating c, one has 2d 1  3 p  3q . For q  1 the right-hand

side is divisible by 3, so q  0 . From what we know, there are only two solutions

 d, p    0,1  2,2 . These solutions give 20  31  4  22 and 24  32  25  52

respectively.
4. Ans: 298  5
an  an 1  2an  2

an  an 1  2 an 1  an  2 

 2n 2  a1  a2  .

So a100  a99  298  5 .

5. Ans: 872
Let an denote the number of sparse numbers with no more than n binary digits.
In particular, for numbers with less than n binary digits after removing leading
zeroes, append leading zeroes so all numbers have n binary digits when
including sufficiently many leading zeroes. We have that a 0  1 , a1  2 , and

a2  3 since for these lengths, either zero digits are 1 or none digit is 1. We

claim that the recurrence a  an 1  an 3 holds for n  3 . We split this analysis

into two cases; numbers where the nth binary digit is 0 or 1. When the nth
binary digit is zero, we can remove that zero to get a valid number with n  1
binary digits. When the n the binary digit is one, it is known that the n  1 th

and n  2 th digits are both zero, so we can truncate those to get a valid
number with n  3 binary digits. Therefore, the recurrence holds. With the given
initial conditions, a17  872 .
6. The first few Tribonacci numbers are 0, 1, 1, 2, 4, 7, 13, 24, 44, 81, 149.
149 is the smallest Tribonacci number greater than 100, and it also turns out to
be prime, so that is our answer.
7. Ans: 72381

2 Narayana Educational Institutions

 CLASS 8th & 9th ADV IOQM PRACTICE TEST-3_Dt.19-02-2024

Observe that if the equation ax  by  n has m solutions, the equation

ax  by  n  ab has m  1 solutions. Also note that ax  by  ax 0  by0 for

0  x 0  b,0  y0  a has no other solution than  x , y    x 0 , y0  . (It is easy to

prove both if you consider the fact that the general solution has form
 x ' bk , y ' ak  .) So there are ab such n and their sum is
2 2 ab  2ab  a  b 
 ax  by  2010ab   2010a b
0 y b

2
0 y a

8. Ans: 05
The one-digit boring primes are 2, 3, 5, and 7. The only two-digit boring prime is
11, since 11 divides all other two-digit boring numbers. No three-digit boring
numbers are prime, since 111 divides all of them and 111 = 3 × 37. No four-digit
boring numbers are prime since they are all divisible by 11. Therefore, there are
5 positive integers less than 10000 which are both prime and boring.
9. Using brute force, we not that 3, 4, 5, and 6 are invalid, but 7  213 . Thus, the
answer is 7.
10. Ans: 09
Let the 1962 digit number be a. First of all note that 9 | x,y,z. This is because a
1962 1962
a  i 1
ai 10i   i 1
ai mod 9  x . Now clearly the largest value of x would be
1962 i
obtained if a  i 1
9 10  , hence x  1962  9  17658 . It follows that,

y  1  7  6  5  8  36 and finally that z  9 . However 9|z so z  9 .

11. For any positive integer k and x, the following relations are equivalent
 x   k  k 2  x  k  12  x  k 2 , k 2  2k  , so 2k  1 values of x satisfy the
   
relation. Since 442  1936  1988  2025  452 and 1988  1936  1  53 ,
S  1 3  2  5   3  7      43  87   44  53 

 2 12  22      432   1  2      43   44  53 

43  44  87 43  44
   2332  54868  946  2332  58146
3 2

Since 2402  57600  2412  58081  S  2422  58564,  S   241

12. x  y  z  664 implies that z  664, y  665, x  666 .

3 Narayana Educational Institutions

 CLASS 8th & 9th ADV IOQM PRACTICE TEST-3_Dt.19-02-2024

Since 2x  3y  4z  5992, y is even, i.e. y  666 .

Since 669  668  664  2001  1998 , so y  668 , i.e. y  666 , hence
2x  4z  5992  3  666  3994 ,
i.e. x  2z  1997 . Therefore x is odd, hence, from the first equation, z is also
odd. 664  z  666 implies z  665 , then x  667 . Thus the answer is
x  667, y  666, z  665 .
13. If a one diigit numebr a is good number, then a  4a , i.e. a  0 , so no one digit
good number exists.
Let ab  10a  b be a two digit good number, then 10a  b  4 a  b  implies
2a  b , so there are four good numbers 12, 24, 36, 48, and their sum is 120.
Three digit good number abc satisfies the equation 100a  10b  c  4 a  b  c  ,
i.e. 96a  6b  3c  0 . Since 96a  6b  3c  96  0  27  0 always, so no solution
for a, b, c  , i.e. no three digit good number exists.

Since a number with n n  4 digits must be not less than 10n 1 , and the 4
times of the sum of its digits is not greater than 36n . For n  4 ,
10n 1  36n  36 10n  3  n   0 , so no n digit good number exists if n  4 .

Thus, the sum of all good numbers is 120.

14. Let n  abc . By assumption the carry of digits must have happened when doing
the addition abc  3 , therefore c  7 .
By S 0 and S1 we denote the sum of digits of n and the resultant number
respectively. Three cases are possible:
(i) If a  b  9, then S 0  9  9  7  25 , but S1  1  c  3  10   3 , a
contradiction. Therefore the case is impossible.
(ii) If a  9, b  9, then S0  a  9  c ,S1  a  1   c  3  10   a  c  6 .

Therefore 3 a  c  6  a  9  c , i.e. 2 a  c   27 , a contradiction. So no

solution.
(iii) If b  9 , then S0  a  b  c , S1  a  b  1  c  3  10   a  b  c  6 , it

follows that 3 a  b  c  6  a  b  c , i.e. a  b  c  9, therefore

abc  108,117, 207
Thus, abc  108 or 117 or 207.

4 Narayana Educational Institutions

 CLASS 8th & 9th ADV IOQM PRACTICE TEST-3_Dt.19-02-2024

26 16
15. Let A   25733  46  . From 25733  733   49   7  7  mod 50  and

46  4  mod 50  , if follows that

26 26
A   25733  46   7  4  326  mod 50 
2
35  243  7  mod 50  yields 310   7   1  mod 50  , so
2
A  326   310   35  3  1  7   3   21  29  mod 50  ,
26
i.e. the remainder of  25733  46  modulo 50 is 29.

*** END OF THE QUESTION PAPER***

5 Narayana Educational Institutions

Corporate Office: 10th Floor, Melange Tower; No.80-84, Pathrika Nagar; Hitech-City, Madhapur, Hyderabad.
Telangana - 500 081.
Toll Free: 1800-102-3344 : info@narayangaroup.com : http://www.narayanagroup.com