MATHEMATICS

PRE-RMO
WORKSHEET-7 (PRACTICE QUESTIONS)

NUMBER SYSTEM 10. Find the remainder, when 19981999 + 19991998

1. Let f (x) be a polynomial with integral is divided by 7.

coefficients. Suppose that both f (1) and f (2)

are odd. Then, prove that, for any integer n, f 11. Prove that a number is divisible by 11 if and

(n) ≠ 0. only if the difference of the sum of the odd

ranked digits and the sum of the even ranked

2. If a, b, c are positive integers less than 13 such digits is divisible by 11.

that [i.e., 11 | (d1d2 … dk)10 if and only if 11 | ((d1 +

2ab + bc + ca ≡ 0 (mod 13) d3 + d5 + …) – (d2 + d4 + d6 + …)) where d1,

ab + 2bc + ca ≡ 6abc (mod 13) d2, …, dk are the digits of the number (dd2 …

ab + bc + 2ca ≡ 8abc (mod 13) dk)10 written in decimal form.]

Then determine the remainder when a + b + c

is divided by 13. 12. Prove that (41999 + 71999 – 2) is divisible by 9.

3. Find the last three digits of 200511 + 200512 + 13. Show that (3099 + 61100) is divisible by 31.

… + 20052006.
14. Prove that the number (10790 – 7690) is

4. Let n be a number that is made from a string of divisible by 1891.

5s and is divisible by 2003. What is the last 6

digits of quotient when n is divided by 2003? 15. Prove that (11n+2 + 122n+1) is divisible by 133.

5. If a and b are two integers such that 11

divides a2 + b2, show that 121 divides a2 + b2.

6. Show that if the sum of the square of two

whole numbers is divisible by 3, then each of
them is divisible by 3.

7. Solve the following:

(a) 5x ≡ 7 (mod 21)

8. Find the last two digits of 31234.

9. Find the last two digits of 7100 – 3100.

Corporate Office : Motion Education Pvt. Ltd., 394 - Rajeev Gandhi Nagar, Kota 8003899588 | Page # 1