Scribd
Upload
3 views3 pages

Number Theory (Part-03) _ DPP 04 (of Lec 05)

The document consists of a series of number theory problems and their solutions, including calculations involving modular arithmetic, integer equations, and properties of numbers in different bases. It features problems such as finding remainders, determining sums of digits, and analyzing integer solutions to equations. The answer key provides detailed solutions and explanations for each problem presented.

Uploaded by

priti.sahu.121986
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views3 pages

Number Theory (Part-03) _ DPP 04 (of Lec 05)

The document consists of a series of number theory problems and their solutions, including calculations involving modular arithmetic, integer equations, and properties of numbers in different bases. It features problems such as finding remainders, determining sums of digits, and analyzing integer solutions to equations. The answer key provides detailed solutions and explanations for each problem presented.

Uploaded by

priti.sahu.121986
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

1

IOQM 2025
Number Theory (Part-03) DPP-4

1. Find the last two digits of 2999 . 8. If the number (33333)2 + 22222 is expressed as
a single decimal number, then the sum of its digits
is
2. Find the remainder when 7200 +11800 is divided
(A) 10 (B) 15
by 101.
(C) 20 (D) 25

3. Is it possible for the sum of the first several


9. A three digit non-zero number ' ABC in base 5,
natural numbers to be 1989? when converted to base 7, becomes ' CBA '.
Which of the following is necessarily true?
4. What is the remainder when 321 + 921 + 2721 + 8121 (A) A must be 2
is divided by (320 + 1)? (B) B must be 0
(C) C must be 2
5. Let P be the product of the first 100 positive odd (D) None of these
integers. Find the largest integer k such that P is
divisible by 3k. 10. The product of two numbers 231 and ABA is
BA4AA in a certain base system (where base is
6. An integer solution of the equation 1990x – less than 10), where A and B are distinct digits.
1989y = 1991 is What is the base of that system?
(A) x = 12785; y = 12768; (A) 5 (B) 6
(B) x = 12785; y = 12770; (C) 7 (D) 8
(C) x = 11936; y = 11941;
(D) x = 13827; y = 12623;.

7. The number of positive integer solutions (x, y, z)


for the system of simultaneous equations
xy + xz = 255
 is:
xy + yz = 31
(A) 3 (B) 2
(C) 1 (D) 0
2

Answer Key
DPP-4
1. 210  24mod (100) number of threes in 200! decreased by the
numbers of threes in 100! there are
220  76mod (100)
 200   200   200   200 
(2 ) 20 49
 76 mod (100 )
49  3  +  9  +  27  +  81 

2980  76mod (100) = 66 + 22 + 7 + 2 = 97


threes in 200! and
219  38mod (100)
100  100  100  100 
2999  88mod (100)  3  +  9  +  27  +  81 
= 33 +11+ 3 +1 = 48
2. 7 100
 1mod (101) and 11 100
 1( mod101) threes in 100!
therefore, we have a total 97 – 48 = 49
7200  1mod (101) and 11800  1( mod101)

7200 + 11800  2( mod101) 6. (C)


The given equation implies y  1 (mod10), only
n ( n + 1) C is possible. By checking (C) is a solution. Thus
3. = 1989
2 the answer is (C).
n (n + 1) = 3978
3978  3mod (5) 7. (B)
The second equation leads to y = 1, x + z = 31 at
n ( n + 1)  0,2,1mod ( 5)
once.
not possible
By substituting them into the first equation it
follows that
4. (60)
x (1 + 31 − x ) = 225
Let us get terms of 321 + 921 + 2721 + 8121 in
20 x2 − 32x + 255 = 0 ,
terms of 3 +1 . Now
( x − 15)( x − 17 ) = 0
(
321 = 321 + 3 − 3 = 320 *3 + 3 − 3 = 3 320 +1 − 3 ) x1 = 15,x2 = 17
( 20
)
Now 3 3 +1 − 3 divided by 3 + 1 will
20
Thus the solutions are x = 15, y = 1, z = 16 and x

( )
2 = 17, y = 1, z = 14. The answer is (B)
leave a remainder of -3 Also, 921 = 321 will

leave a remainder of (–3)2 or 9. Thus the 8. (A)


remainder is −3 + (−3) + (−3) + (−3)
2 3 4
(33333)2 + 22222 = (3 11111) 2 + 11111  2
= −3 + 9 − 27 + 81 = 60 = 11111(9 × 11111 + 2)
= 11111(99999 + 2)
5. (49) = 11111)(100000 + 1)
Note that the product of the first 100 positive odd = 1111100000 + 11111 = 1111111111
integers can be written as 1.3.5.7...... 195.197.199 So, Sum of digits
1.2...200 2001 = 1 + 1 + 1+ 1 + 1 + 1 + 1 + 1 + 1 + 1 = 10
= = 500 . Hence, we seek the
2.4...200 2 .100
3

9. (B) 10. (B)


ABC5 = (25 A + 5 B + C)10 231 is a multiple of 11

CBA7 = (49C + 7 B + A)10 Hence , we can write ( b + 4 + a ) − 2a = 0 or

A.T.Q. 25 A + 5 B + C = 49C + 7 B + A (k) + 1(let's take (k) + 1)


24 A − 2 B − 48C = 0 ie. b = k + a − 3
12 A = B + 24C 231*aba = 2a(k)4 + ( 2 b + 3a ) (k)3
12 ( A − 2C) = B + (3a + 3 b) (k)2 + (3a + b)( k ) + a
 B must be multiple of 12 but B  5 now put b = k + a − 3 , in above equation
B=0
Compare it with ba4aa
We get, 2a + 2 = b,4a − 3 = a
solving them gives a = 1, b = 4
Hence, k = b − a + 3 = 6

PW Web/App
Library
Telegram
YouTube

You might also like