CHAPTER-2 NUMBER SYSTEM

2.1 Prime Decomposition

Basic Knowledge
 1. Terms
• Prime number: A prime number is a positive integer greater than 1 and only divisible by 1 and
itself Another way of saying this is that a prime number is a positive integer with exactly two
factors (1 and itself).
• The smallest prime number: 2, which is an even number and the only even prime number.
• Theorem 1: There are infinite many prime numbers.
• Theorem 2: There is no greatest prime number.
• Composite number: When a number has more than two factors, the number is called a composite
number.
• Relatively prime: If two positive integers have no common factor except 1, the two positive
integers are said to be relatively prime, for example, 4 and 9 are relatively prime.
 2. Method to determine a prime number
Theorem 3 (The square root rule): If ‘a’ is not divisible by all the prime numbers less than or

equal to a, then a is a prime number.

Example 1: Find all the prime numbers less then 50.

Solution: Since 8 is the smallest integer > 50 , all the prime numbers less than 8 are: 7,5,3 and 2.
Step 1: We make a chart of the first fifty positive (1–50):

Step 2 : Remove 1, because it is not prime:

Step 3 : Darken 2, because it is the smallest positive even prime. Now remove every multiple
of 2.

Step 4 : Darken 3. Then remove all multiples of 3.

NUMBER SYSTEM 1
 Step 5 : Darken the next prime number 5. Now remove all the multiples of 5.

Step 6: Darken the last prime number 7. Remove the multiples of 7.

We have just removed all the numbers that are not prime numbers from 1 to 50. The table
above shows all the prime numbers less than 50.
The method we used is called the sieve method.

Example 2: How many prime number are there between 51 and 600 ?
Solution: Let the prime number be p.
51  p  600

Since 72 = 49 < 51 , p is greater than 7.

Since 25 = 625 > 600 , p is smaller than 25
2

We look at all prime numbers greater than 120?

Example 3: What is the smallest prime numbers the 120?

Solution: 121 (11  11), 122 (even number), 123 (divisible by 3), 124 (even number), 125 (multiple), 125
(multiple of 5), and 126 (even number) are not prime. The next is 127.
We know that 112 = 121 < 127 < 144 = 122. We only to test 127 is 11,7,5,3 and 2. We are sure
that 127 is neither divisible by 2, nor 3 nor 5. We need to divide 127 by 7 and 11, respectively
127 = 7  7 + 1
127 = 11  11 + 6
So, 127 is the smallest prime number greater the 120.

• 3. First 46 prime numbers (up to 200)

There are 25 prime number form 1 to 100.

There are 21 prime number form 101 to 200.

NUMBER SYSTEM 2
• 4. Some properties:
Property 1
A prime number p can only be written as p  1.
In other words, a prime number p can only be divided, a remainder, by itself and 1.
If p is a prime number and p = mn, then one of two number m and n must be 1 and another one must
be p.

Example 4: Find the value of a positive integer x such that, when 64 is taken away from it, the results
is a square number and when 25 is added to it, the result is also a square number.
x –64 = n2 
Solution:   m – n = 89  (m – n) (m + n) = 89
2 2
x + 25 = m2 
Since 89 is a prime number and m +n > m – n,
m + n = 89

  m = 45, n = 44
m–n = 1  
x = 452 – 25 = 200

Example 5: Find the value of b – c if a3 = b2, c2 = d and d – a = 5, where a, b, c and d are positive
integers.
Solution: Since a and b are positive integers, let a3 = b2 = t32 = t6, we gat : a = t2 and b = t3
Therefore, d–c = 5 can be written as C2 – t2 = 5 or (C–t) (C + t) = 5
Since 5 is a prime number and C + t > C – t, we have :
c + t = 5

  c = 3, t = 2
c–t = 1 
b – c = 23 – 3 = 5

Example 6: Assume that a, b, c and d are positive integers such that a5 = b4, c3 = d2 and c – a =
19/Determine d-b.
Solution: Since a and b are positive integers, let a5 = b4 = m5×4 = m20, we get : a = m4 and b = m5.
Let c3 = d2 = n3×2 = n6, we get : c = n2 and d = n3.
Therefore, c – a = 19 can be written as n2 – m4 = 19 or (n – m2)(n + m2) = 19
Since 19 is a prime number and n + m2 > n – m2, we have : n – m2 = 1 and n + m2 = 19
Solve for m and n, we get : m = 3 and n = 10.
Therefore, d = n3 = 103 = 1000, and b = m5 = 35 = 243. So d – b = 1000 – 243 = 757.

Property : 2
If the sum of two prime numbers is an odd number, then one of the two prime numbers must be
2.
Example 7: The sum of two prime numbers is 39. What is their product ?
Solution: Since the sum is an odd number, one prime number must be 2. The other one is then 39 –
2 = 37. The product is 2 × 37 = 74.

Example 8: The difference of two prime numbers is 2011. What is the value of the larger prime number?
Solution: Let the two prime numbers be x and y and x < y.
Since y – x = 2011, x must be 2 and y = 2013.

Example 9: The sum of two prime numbers is 49. What is the sum of the reciprocals of the two prime
numbers ?
Solution: Let the two prime numbers be x and y and x < y.
Since y – x = 2011, x must be 2 and y = 2013.
NUMBER SYSTEM 3
Example 9: The sum of two prime numbers is 49. What is the sum of the reciprocals of the two prime
numbers?
Solution: Let the two prime numbers be x and y and x < y.
Since y + x = 49, x must be 2 and y = 47.
1 1 49
+ =
47 2 94

Example 10: Three prime numbers p, q and r satisfy the following conditions : p + q = r and 1 < p < q.
Find the value of p.
Solution: Since p, q and r are all prime numbers, r must be and odd number and one of the two
numbers o and q must be 2.
Since 1 < p < q. p = 2.

Example 11: Two prime numbers p and q satisfy the following conditions : p = m + n and q = mn, where
both m and n are positive integers. Find the value of pq – qp.
Solution: Since q is a prime number and q = mn, m or n must be 1.
Let m = 1, we have q = n and p = 1 + n = 1 + q.

Example 12: Find where both p and q are prime numbers, if 3p + 5q = 31 ?

Solution: Since 3p + 5q = 31, 3p or 5q must be even since two odd numbers do not sum to an odd
integer.
Case I: If 3p is even, p must be 2. We then have 5q = 31 – 3 × 2 = 25  q = 5
p 2 1
= =
3q + 1 3  5 + 1 8
Case II : If 5q is even, q must be 2. We then have 3p = 31 – 5 × 2 = 21  p = 7
p 7
= =1
3q + 1 3  2 + 1

Example 13: For how many positive integer n is n2 – 3n + 2 a prime number?

Solution: We know that n2 – 3n + 2 = (n – 1) (n – 2) is a prime if and only if
Case I : (n – 1) = 1 and (n – 2) is a prime
n – 1 = 1  n = 2 and (n – 2) = 0 which is a not a prime
Case II : (n – 2) = 1 and (n – 1) is a prime.
n – 2 = 1  n = 3 and (n – 1) = 2 which is a prime.
Case III : (n – 1) = – 1 and (n – 2) is a negative value and | (n – 2) | is a prime.
n – 1 = – 1  n = 0 which is not a positive integer and we do not need to verify.
n–2
Case IV : (n – 2) = – 1 and (n – 1) is a negative value and | (n – 1) | is a prime
n – 2 = – 1  n = 1 and (n – 1) = 0 which is not negative.
Therefore, n2 – 3n + 2 is prime only when n = 3.

Example 14: The product of three prime numbers is five times the sum of these prime numbers and it
is also divisible by 5. Find these prime numbers.
Solution: Since the product is divisible by 5, one of these prime numbers must be 5.
Let p and q be the other two prime numbers, we have : 5pq = 5(p + q + 5)
 pq – p – q + 1 = 6  (p – 1) (q – 1) = 6 = 2 × 3 = 1 × 6.
If p – 1 = 2 and q – 1 = 3, q = 4 is not a prime number which is not possible.
If p – 1 = 1 and q – 1 = 6, p = 2 and q = 7.
The solution is (2,5,7)
NUMBER SYSTEM 4
Example 15: For a positive integer such that the sum of the positive integer and 100 is square number,
and the sum of the positive integer and 168 is also a square number.
Solution: Let x be the positive integer.
x + 100 = y2 …..(i)
x + 168 = z2 ….(ii)
(ii) – (i)
z2 – y2 = 68  (z – y) (z + y) = 68 = 22 × 17
Since 0 < z – y < z + y, we have
z–y = 1  z–y = 2 
 z–y = 4  
  
z + y = 2  17 
2
z + y = 2  17 
 z + y = 17

On solving these equation : y = 16, z = 18 and x = 156

Example 16: It is given that a, b, c and d are four positive prime numbers such that the product of these
four prime numbers is equal to the sum of 55 consecutive positive integers. Find the
smallest possible value of a + b + c + d. (Remark : The four numbers a, b, c, d are not
necessarily distinct.)
Solution: The sum of 55 positive consecutive integers is at least (55 × 56)/2 = 1540. Let the middle
number of these consecutive positive integers be x. Then the product abcd = 55x = 5. 11 .x.
So we have 55x  1540 and thus x  28. The least value of a + b + c + d is attained when x
= 5(7). Thus the answer is 5 + 11 + 5 + 7 = 28.

NUMBER SYSTEM 5
 EXERCISE – 2.1

1. If a + b + c = 66 and ab + bc + ca = 1071, where a, b and c are all prime numbers, find the value of
abc.
(A) 1007 (B) 2876 (C) 1886 (D) 1765

2. The positive inegers A, B, A – B and A + B are all prime numbers. The sum of these four primes is
(A) Even (B) Divisible by 3 (C) Prime (D) Divisible by 7

3. For how many positive integers a is a4 – 3a2 + 9 a prime number ?

(A) 5 (B) 7 (C) 6 (D) 2

4. If n is a positive integer greater than 1, then n4 + 4 is a ________ number.

(A) Composite (B) Composite odd number
(C) Composite even number (D) Prime

5. What is the smallest positive integer x for which x2 – x + 5 is not a prime?

(A) 5 (B) 7 (C) 6 (D) 13

6. What is the smallest positive integer x for which x2 – x + 5 is not a prime?

(A) 155 (B) 157 (C) 156 (D) 154

7. Some prime number are 1 more then a square, as in 42 + 1 = 17. How many primes p  100 are of the
from p = n2 + 1?
(A) 5 (B) 7 (C) 4 (D) 23

8. How many prime numbers satisfy 300  x  700 ?

(A) 5 numbers (B) 3 numbers (C) 2 numbers (D) 1 number

51 1 1 5
9. The number of pairs of prime numbers (p,q) satisfying the condition  +  will be
100 p q 6
(A) 49 (B) 24 (C) 50 (D) 48

10. The number of positive integral values of n of n for which (n 3 – 8n2 + 20n – 13) is a prime number
is
(A) 2 (B) 1 (C) 3 (D) 4

11. The number of positive integers ‘n’ for which 3n – 4, 4n – 5 and 5n – 3 are all primes is
(A) 1 (B) 2 (C) 3 (D) infinite

12. m, n are natural numbers. The number of pairs (m, n) for which m 2 + n2 + 2mn – 2013m – 2013n –
2014 = 0 is.
(A) 2000 (B) 2013 (C) 1023 (D) 2007

13. Suppose that a, b, c are distinct numbers such that (b – a)2 – 4 (b – c)(c – a) = 0, find the value of
b–c
.
c–a

14. Suppose that p and q are prime numbers (p > q) and they are roots of the equation x2 – 99x + m =
0 for some m. What is the value of p – q ?

15. What is the largest possible prime value of n2 – 12n + 27, where n ranges over all positive integers?

NUMBER SYSTEM 6
 2.2 Divisibility test and cyclicity

• Basic Knowledge
“Divisible by” means “when you divide one number by another number, the result is a whole number”.
“Divisible by” and “can be evenly divided by” mean the same thing.
The expressions abc, abc and abc are the same, abc = abc = 100a + 10b + c. They represent a three-

digit number such as 234 = 234 = 234.

• Divisibility Rules
Divisibility rule for 2, 4, 8 and 16 :
A number is divisible by 2 if the last digit of the number is divisible by 2(21).
A number is divisible by 4 if the last two digit of the number are divisible by 4 (22).
A number is divisible by 8 if the three digits of the number are divisible by 8 (23).
A number is divisible by 16 if the last four digits of the number are divisible by 16 (24).

Example 1: For what digit(s) x will be 7-digits number 3xx6xx2 be divisible by 4 ?

Solution: 1, 3, 5, 7 and 9
The two-digit number x2 needs to be divisible by 4 by the divisible rules. The following
numbers work :
12, 32, 52, 72 and 92

Example 2: How many different 4-digit numbers can be formed using the digits 2,4,5,6 and 7 such that
no digit s repeat and the number is divisible by four?
Solution: 36
The last digit needs to be even in order for the number to the divisible by 4. So we list all
the two-digit numbers that are divisible by 4 : 52, 72, 24, 64, 56 and 76 to be last two the
two-digits. There are 3 × 2 = 6 ways to arrange the other two digits. There are a total of 6 ×
6 = 36 such 4-digit numbers.

Example 3: If 4b + 2c + d = 32, is the 4-digit number abcd dibisible by 8?

Solution: Yes
We must determine if the number formed by the last three digits is divisible by 8.
bcd = 100b + 10c + d = 96b + 8c + (4b + 2c + d) = 96b + 8c + 32 = 8(12b + c + 4)
bcd is in fact a multiple of 8. So abcd is divisible by 8.

• Divisibility rule for 5, 25, 125 and 625:

A number is divisible by 5 if the last of the number is divisible by 5 (51).
A number is divisible by 25 if the last two digits of the number from a number that is divisible by
25 (52).
A number is divisible by 125 if the last three digits of the number from a number that is divisible by
125 (53).
A number is divisible by 625 if the last four digits of the number from a number that is divisible by
625 (54).

Example 4: The four-digit number 6BB5 is divisible by 25. How many such four-digit number are there?
Solution: (6225 and 6775)
If the given number is divisible by 25, B5 should be divisible by 25.
25 × 1 = 25 and 25 × 3 = 75
NUMBER SYSTEM 7
Example 5: The six-digit number 713EF5 is divisible by 125. How many such six-digit number are there?
Solution: (713125, 713375, 713625 and 713875)
If the given number is divisible by 125, EF5 should be divisible by 125.
125 × 1 = 125, 125 × 3 = 375, 125 × 5 = 625 and 125 × 7 = 875.

• Divisibility rule for 3 and 9

A number is divisible by 3 if the sum of the digits of the number is divisible by 3.
A number is divisible by 9 if the sum of the digits of the number is divisible by 9.

Example 6: What is the sum of all possible digits which could fill the blank in 47 ____ 21 so that the
resulting five-digit number is divisible by 3?
Solution: Let the digit be x.
4 + 7 + x + 2 + 1 = 14 + x
 x = 1, 4 and 7 in order for 14 + x to be divisible by 3
The sum is 1 + 4 + 7 = 12

Example 7: What is the largest digit which can replace be to make the number 437, b32 divisible by 3?
Solution: 4 + 3 + 7 + b + 3 + 2 = 19 + b
 b = 2, 5 and 8
The greatest value of b such that 437, b32 is divisible by 3 is 8.

Example 8: The three-digit number 2a3 is added to the number 326 to given the three-digit number 5b9.
If 5b9 is divisible by 9, then a + b equal
Solution: The sum of the digits of 5b9 must be divisible by 9, 5 + b + 9 = 14 + b, b must be 4.
2a3 + 326 = 549  2a3 = 549 – 326 = 223 a=2
a+ v = 2 + 4 = 6

• Divisibility rule for 7, 11 and 13:

(1) If you double the last digit and subract it from the rest of the number and the answer is
divisible by 7. The number is divisible by 7, you can apply this rule to that answer if
necessary.
(2) To find out if a number is divisible by 11, odd every other digit, and call that sum “x”. Add
together the remaining digits, can call that sum “y”. Take the positive difference of x and y.
If the difference is zero or a multiple of eleven, then the original number is a multiple of
eleven.
(3) Delete the last digit from the number and then subtract 9 times the deleted digit from the
remaining number. If what is left is divisible by 13, then so is the original number. Repeat
the rule if necessary.
(4) If the positive difference of the last three digit and the rest of the digits is divisible by 7, 11
or 13, then the number is divisibly by 7, 11 or 13 respectivley.

Example 9: Which number is not divisible by 7 ? 616, 567, 798 or 878

Solution: 616 : 61 – 6 × 2 = 61 – 12 = 49 (divisible by 7)
567 : 56 – 7 × 2 = 56 – 14 = 42 (divisible by 7)
798 : 79 – 8 × 2 = 79 – 16 = 63 (divisible by 7)
878 : 87 –8 × 2 = 87 – 16 = 71 (not divisible by 7)

NUMBER SYSTEM 8
Example 10: Which number is not divisible by 7? 630616, 588567, 28105 or 40111?
Solution: 630616 : 630 – 616 = 14 (divisible by 7)
588567 : 855 – 567 = 21 (divisible by 7)
28105 : 105 – 28 = 77 (divisible by 7)
40111 : 111 – 40 = 71 (not divisible by 7)

Example 11: If 13x + 8y is divisible by 7, prove that 9x + 5y is also divisible by 7.

Solution: Since 13x + 8y is divisible by 7, it will not change the divisibility of a number if we add 13x +
8y to number.
To prove that 9x + 5y is divisible by 7. We can add 13x + 8y to it until the number is divisible
by 7.
9x + 5y  9x + 5y + (13x + 8y) = 22x + 13y  22x + 13y + (13x + 8y) = 35x + 21y = 7(5x + 3y)
Since 7(5x + 3y) is divisible by 7, 9x + 5y is also divisible by 7.

Example 12: Which digit should replace a in the units place so that 9867542a is divisible by 11?
Solution: Let x = 9 + 6 + 5 + 2, y = 8 + 7 + 4 + a
(x – y) = (9 + 6 + 5 + 2) – (8 + 7 + 4 + a) = 22 – 19 – a = 3 – a.  a=3

Example 13: A and B are non-zero digits for which A468B05 is divisible by 11. What is A + B?
Solution: Let x = 5 + B + 6 + A, y = 0 + 8 + 4
x – y = (5 + B + 6 + A) – (0 + 8 + 4) = 11 + B + A – 12 = B + A – 1  B + A = 12

Example 14: If 7x + 2y – 5z is divisible by 11, x, y and z are all integers, prove that 3x – 7y + 12z is also
divisible by 11.
Solution: Since 7x + 2y – 5z is divisible by 11, it will not change the divisibility of a number if we add
7x + 2y – 5z to the number.
To prove that the expression is also divisible by 11, we can add 7x + 2y – 5z to it until the
number is divisible by 11.
Also, when we multiply a number by an integer that is not a multiple of 11, the divisibility of
the number will not change.
3x – 7y + 12z  4(3x – 7y + 12z) + 3(7x + 2y – 5z) = 11(3z – 2y + 3z)
Thus, 3x – 7y + 12z is divisible by 11.

• Divisibility rule for 6, 10, 12, 14, 15, 18, 24 and 36 :

A number is divisible by 6, if the number is divisible by both 2 and 3.
A number is divisible by 10, if the number is divisible by both 2 and 5.
A number is divisible by 12, if the number is divisible by both 3 and 4.
A number is divisible by 14, if the number is divisible by both 2 and 7.
A number is divisible by 15, if the number is divisible by both 3 and 5.
A number is divisible by 18, if the number is divisible by both 2 and 9.
A number is divisible by 24, if the number is divisible by both 3 and 8.
A number is divisible by 36, if the number is divisible by both 4 and 9.

Example 15: What is the greatest three-digit number that is divisible by 6 ?

Solution: The number must be divisible by both 2 and 3. So the number is even and the sum of its
digits is divisible by 3. If the number is 99x , x = 6 works.

NUMBER SYSTEM 9
Example 16: If the 4-digit number 273X is divisible by 12, what is the value of x
Solution: The 4-digit number 273X is divisible by 3 and 4.
2 + 7 + 3 + X = 12 + X, must be divisible by 3, so X can be 0, 3, 6 and 9. On other hand, X
must be even so that the number is divisible by 4, so we have X = 0 or 6. 3X must also be
divisible by 4, so X = 6 is the only value that works.

Example 17: Find distinct digits A and B such that A47B is as large as possible by 36. Name the number.
Solution: A47B is divisible by 36 and it is also divisible by 9 and 4.
A + 4 + 7 + B = A + B + 11  A + B = 7 and A + B = 16
Since A and B are distinct, A + B = 7
7B needs to be divisible by 4 and we want the greatest value of A47B.
A = 5 and B = 2. A47B = 5472.

• Cyclicity
Note: The following terms have the same meaning : last digit, ones digit and units digits.

• Patterns of the last digit of an :

The last digits of an have patterns shown in the table below.
For example, when a = 2.
21 = 2 22 = 4 23 = 8 24 = 16
25 = 32 26 = 64 27 = 128 28 = 256,….
The last digits of 2 demonstrate a pattern : 2, 4, 8, 6, 2, 4, 8, 6 etc……
n

Example 18: Find the last digit of 31999.

Solution: The pattern of the last digits of 3n is : 3, 9, 7, 1 (repeating every four numbers)
When 1999 is divided by 4, then quotient is 499 and the remainder is 3. The last digit of 31999
is the same as the last digit of 33.
So the last digit of 31999 is 7.
Or 31999 = 34 × 499 + 3 = 33 = 27. The last digit is 7.

Example 19: What is the units digit in the number named by 248?
Solution: The pattern for the last digit of 2n is 2, 4, 8, 6, 2, 4 etc.
48  4 = 12. In other words, the last digit of 248 is the same as the last digit of 24.
So the last digit is 6.
Or 248 = 24 × 11 + 4 = 24 = 16. The last digit is 6.

NUMBER SYSTEM 10
Example 20: What is the units digit in the number named by 7 22?
Solution: The pattern for the last digit is : 7, 9, 3, 1, 7, 9, 3, 1, etc.
When 22 is divided by 4, the quotient is 5 and the remainder is 2. The last digit of 7 22 is the
same as the last digit of 72, so the last digit is 9.
Or 722 = 74 × 5 + 2 = 72 = 49. The last digit is 9.

Example 21: What is the units digit of 19981998?

Solution: The units of 19981998 is the same as the units digit of 81998.
The pattern for the last digit is : 8, 4, 2, 6, 8, 4, 2, 6, etc.
When 1998 is divided by 4, the quotient is 499 and the remainder is 2. The last digit of 8 1998
is the same as the last digit of 82, so the last digit is 4.
Or 81998 = 84 × 499 + 2 = 82 = 64. The last digit is 4.
Same very useful formulas :
an – bn = (a – b) (an–1 + an–2b + an–3b + … + abn–2 + bn–1) where n is positive integer
an – bn = (a + b) (an–1 – an–2b + an–3b – …. + abn–2 – bn–1) where n is even
an + bn = (a + b) (an–1 – an–2b + abn–3b – ….–abn–2 + bn–1) where n is odd

Example 22: What are the last two digit of 2202?

Solution: 04, (order is important)
First we find the last digit of 2202. We know that it is the same as the last digit of 2 2, which
is 4.
The tens digit of 2202 can be obtained by the following way :
1 202
10
(
2 –4 =
10
)
4 200 2
(
2 – 1 = 2200 – 1 =
5
)2
5
( ) ( )(
1650 – 1 1649 + 1648 + .... + 16 + 1 )
 
= 6(649 + 648 + …… + 6 + 1) = 6  6 + 6 + 6 + .... + 6 + 1 = 6(49 × 6 + 1) = 1770 = 0 (mod 3)
 
 49 6's 
So the last two digit are 04.

Note : When we obtain the form

p
(
q n
)
x – yn , where (p,q) = 1, n is positive integer, we need

to make sure that p | x – y. This is necessary condition in order to get the correct digit.
2 200
For example,
5
( )
2 – 1 is not a good from for example 1 but
2
5
(
1650 – 1 is. )

Example 23: Find the last two digits of 62002.

Solution: Method – 1 :
61 = 06
62 = 36 63 = 16 64 = 96 65 = 76 66 = 56
6 = 36
7
6 = 16
8
6 = 96
9
6 = 76
10
611 = 56
The last two digits of 6n (n  2) have the pattern : 36, 16, 96, 76, 56, …… which repeats every
5 terms. 2002 = 5 × 400 + 2. The remainder of 2002 divided by 5 is 2, so the last two digits
are equivalent to 62, which is 36.
Method – 2 :
We know that the last digit of 62002 is 6.
The tens digit can be obtained by the following way :
1 2002
10
(
6 –6 =
10
6)
6 2001 3
5
( ) 3
5
( ) (
– 1 = 62001 – 1 = (6 – 1) 62000 + 61999 + ... + 6 + 1 )
 
( )
= 3 62000 + 61999 + ... + 6 + 1 = 3  6 + 6 + 6 + ... + 6 + 1  = 3 (2000  6 + 1)  3 (Mod. 3)
 
 2000 6's 
So, the last two digits are 36.

NUMBER SYSTEM 11
Example 24: Find the last three digits of 62002.
Solution: As we know that the last two digits of 62002 are 36. The hundreds digit can be obtained in
the following way:
1
( )
36 2000
(
9 2000
)
9  5
( ) ( ) – 1 =
9
( )
400
62002 – 36 = 6 –1 = 6 –1 = 6 7776400 – 1
100 100 25 25   25

9  
25
( 
)
 ( 7776 – 1) 7776399 + 7776398 + ... + 7776 + 1 = 9  311   6 + 6 + 6 + ... + 6 + 1 

 399 6's 
= 9 × 1 × (399 × 6 + 1) = 9 × 1 × (9 × 6 + 1) = 9 × 1 × 5 = 5 (Mod. 10)
So, the last three digits of 62022 are 536.

Example 25: Find the last two digits of 72005.

Solution: The pattern for the last digit is : 7, 9, 3, 1, 7, 9, 3, 1, etc.
2005  4 = 501R1. That means that the last digit of 72005 is the same as the last digit of 71.
so the last digit is 7.
The tens digit can be obtained the following way :
1 2005
10
(
7 –7 = )
7 2004
10
7 –1 = (7
)
491002 – 1 =
10 
7
 10 ( 49 + 1) 7 – 7
1001 1000
(
+ .... + 7 – 1 )
= 35(71001 – 71000 + ….. + 7 – 1) = 5(7 + 250 × (7 –1 + 3 –9) –1)  30  0 (mod 10)
So the last two digits are 07.
Note : an – bn = (a + b) (an–1 – an–2b + an–3b – ….. + abn–2 – bn–1) when n is even.

Example 26: Find the last three digits of 72005.

Solution: We know that the last two digits of 72005 are 07. The hundreds digits can be obtained the
following way :
1
( 7
) ( 7  4
) ( ) − 1 =
7
( )
501
72005 − 7 = 72004 − 1 = 7 (2401 − 1) 2401500 + 2401499 +  + 2401 + 1
100 100 100   100
 7 × 24 × (2401500 + 2401499 + …..+ 24017 + 1)  7 × 4 × (1500 + 1499 + ….+ 1 + 1)
 8 × (501)  8 × 1  8 (mod 10)
So the last three digits of 72005 are 807

Example 27: Find the last three digits of 52012.

Solution: We use f(x) to represent the last three digits of x.
f(51) = 005
f(52) = 025
f(53) = 125
f(54) = 625
f(55) = 125
f(56) = 625
Observe the pattern that when x is an even power of 5, the last three digits are 625 when x
> 53. Since 2012 is even, the last three digits are 625.

Example 28: Find the last non-zero digit in 30!.

Solution: We first obtain the prime factorization of 30!. Observe that 29 is the largest number less
than 30. We have
 30   30   30   30 
  +  2  +  3  +  4  = 26
 2  2  2  2 

NUMBER SYSTEM 12
  30   30   30 
  +  2  +  3  = 14
 3  3  3 
 30   30 
 + 2=7
 5  5 
 30 
 =4
 7 
 30 
 =2
 11 
 30 
 =2
 13 
 30   30   30   30 
 = = = =1
 17   19   23   29 
Thus, 30! = 26. 314. 57. 74. 112. 132. 17. 19. 23. 29
30!
= 219. 314. 74. 112. 132. 17. 19. 23. 29
107
= 614. 25. 74. 112. 132. 17. 19. 23. 29
= 6(2) (1) (1) (9) (7) (9) (3) (9) (mod 10)
= 2(–1) (–3) (–1) (3) (–1) (mod 10)
= 8(mod 10),
Showing that the last non-zero digit is 8.

Example 29: Let S be the smallest positive multiple of 15, that comprises exactly 3k digits with k ‘0’s, k
‘3’s and k’8’s. Find the remainder when S is divided by 11.
Solution: S being a multiple of 5 and 3 must end with ‘0’ and has the sum of digits divisible by 3.
Since 3 + 8 = 11, the smallest positive k such that k × 11 is divisible by 3 is 3. Thus S =
300338880 and the remainder is 0 – 8 + 8 – 8 + 3 – 3 + 0 – 0 + 3 = –5 = 6 (mod 11).

Example 30: Let n be a positive integer. Find the number of positive remainders when
2013n – 1803n – 1781n + 1774n
Is divided by 203.
Solution: For any positive integer n,
2013n – 1803n – 1781n + 1774n = (2013n – 1803n) – (1781n – 1774n)
= (2013 – 1803)u – (1781 – 1774)v = 210u – 7v,
2013 – 1803 – 1781 + 1774 = (2013n – 1781n) – (1803n – 1774n)
n n n n

= (2013 – 1781)x – (1803 – 1774)y = 29x – 29y.

So, 2013n – 1803n – 1781n + 1774n is divisible by 7 × 29 = 2023 for every positive integer n.

Example 31: Find the total number of positive integers n not more than 100 such that n 4 + 5n2 + 9 is
divisible by 5.
Solution: Note that n4 + 5n2 + 9 = n4 – 1 + 5n2 + 10 = (n – 1) (n + 1) (n2 + 1) + 5(n2 – 2.)
If n = 1 or 4(mod 5), then 5 divides n – 1 or n + 1.
If n = 2 or 3(mod 5), then 5 divides n2 + 1.
If n = 0(mod 5), then 5 does not divides (n – 1)n (n2 + 1) but divides 5(n2 + 2), hence does
not divide n4 + 5n2 + 9.
Thus, there are 100  5 = 20 multiples of 5 from 1 to 100. The number of integers thus
required is 100 – 20 = 800.

NUMBER SYSTEM 13
 Exercise – 2.2

1. Given 1x6y7 is a five-digit number divisible by 9. The number of ordered pairs (x, y) satisfying this is
(A) 5 (B) 6 (C) 8 (D) 11

2. The number of three digit numbers that are divisible by 2 but not divisible by 4 is
(A) 200 (B) 225 (C) 250 (D) 450

3. a, b, c are the digits of a nine digit number abcabcabc. Calculate the quotient when this number is
divided by 1001001.
(A) 100a + 10c + b (B) 100c + 10b + a (C) 100a + 10b + c (D) 10a + c

n
4. Find the number of integers n for which is the square of an integer.
20 – n
(A) 1 (B) 2 (C) 3 (D) 4

5. The years of 20th century and 21th century are of 4 digits. The number of years which are divisible
by the product of the four digits of the year is
(A) 7 (B) 8 (C) 9 (D) none of these

6. The number of numbers of the form 30a0b03 that are divisible by 13, where a, b are digits, is
(A) 5 (B) 6 (C) 7 (D) 0

7. A natural n has exactly tow divisors and (n + 1) has three divisors. The number of divisors of (n + 2)
is
(A) 2 (B) 3 (C) 4 (D) depends on the value of n

8. If n = 1010 – 1, the number of digits in n3 is

(A) 30 (B) 28 (C) 32 (D) 27

9. The last two digits of 32012, when represented in decimal notation, will be
(A) 81 (B) 01 (C) 41 (D) 21

10. Give the units digit of the number 32011.

(A) 7 (B) 8 (C) 10 (D) 11

11. When written out completely 162011 has m digits and 6252011 has n digits. Find the value of (m + n).
(A) 8000 (B) 4045 (C) 8045 (D) 7040

12. Find the units digit of (2013)2013.

(A) 12 (B) 3 (C) 5 (D) 7

13. Suppose that n is the product of three consecutive integers and that n is divisible by 7. Which of
the following is not necessarily a divisor of n?
(A) 14 (B) 21 (C) 28 (D) 6

14. Find the last two digits of 9100 – 1.

15. Find the sum of digits of the largest positive integer n such that n! end with exactly 100 zeros.

NUMBER SYSTEM 14
 2.3 Number Theory

Example 1: ‘a’ and ‘b’ are two natural numbers with a + b = 8. If a  b and a2 + b2 has minimum value,
then a and b are given by
(A) 7, 1 (B) 6, 2 (C) 4, 4 (D) 5, 2
Solution: a2 + b2 = a2 + (8 – a)2 = 2a2 – 16a + 64 = 2(a2 – 8a + 16) + 32 = 2(a – 4)2 + 32
This is minimum when a = 4
Then b = 4.

Example 2: A certain number has exactly eight factors including 1 and itself. Two of its factors are 21
and 35 . The number is
(A) 105 (B) 210 (C) 420 (D) 525
Solution: Since the number has exactly eight factors, it has the representation, or where p 's are
primes.
As 21 and 35 are its factors 3, 5, 7 are its factors. Hence the number is 3 × 5 × 7 = 105.

Example 3: Find the sum of all three digit numbers that can be written using the digits 1, 2, 3, 4
(repetitions allowed).
Solution: We may have any one of the four digit 1, 2, 3, 4 in the hundreds place, tens place or units
place. Therefore we have 4 × 4 × 4 = 64 three digit numbers in all. If we consider the units
place of these 64 numbers, we see that each of the four digit appears 16 times. The same
conclusion is true about tens place and hundreds place. So the sum of the 64 three digit
numbers that we can form from the gives four digits is
S = 16 (1 + 2 + 3 + 4) × 100 + 16(1 + 2 + 3 + 4) × 10 + 16 (1 + 2 + 3 + 4) × 1
 S = 16000 + 1600 + 160 = 17760

Example 4: How many two digit numbers divide 109 with a remainder of 4 ?
(A) 2 (B) 4 (C) 3 (D) None
Solution: As remainder is 4, we need two digit divisors of 109 – 4 = 105.
As 105 = 5 × 3 × 7. Two digit divisors are 15, 21 and 35. Thus there are 3 such divisors.
1
Example 5: If a2 + a + 1 = 0 then a2 + is a
a2
(A) Positive integer (B) Positive fraction which is not an integer
(C) Negative integer (D) Negative fraction which is not an integer
Solution: As a  0 from a + a + 1 = 0, we have
2

2
1  1 1 1
a+ = −1 and  a +  = 1  a2 + 2
+ 2 = 1 or a2 + 2 = −1  0
a  a a a

Example 6: The number of integers whose square is a factor of 2000 is

(A) 3 (B) 6 (C) 10 (D) 12
4 3
Solution: As 2000 = 2 ×5 the factors which are square numbers are 22 ,24 ,52 ,22 ×52 ,24 ×52 . Trivially
12 = 1 is also a factor. Thus, the squares of the six numbers 1, 2, 4, 5, 10, 20 are factors of
2000.

Example 7: A three digit number with digits A, B, C in that order is divisible by 9. A is an odd digit and C
is an even digit. B and C are non zero. The number of such three digit numbers is
(A) 4 (B) 8 (C) 16 (D) 20

NUMBER SYSTEM 15
Solution: A + B + C = 9, 18 or 27 and A is odd and C is even, B, C non-zero.
We shall fix the digit A as 1, 3, 5, 7 and 9 and find the corresponding values of B and C and
count the number of numbers.
ABC ABC ABC ABC ABC
(1) 162 (5) 3 4 2 (9) 5 2 2 (13) 7 9 2 (17) 9 7 2
(2) 144 (6) 3 2 4 (10) 5 9 4 (14) 7 7 4 (18) 9 5 4
(3) 126 (7) 3 9 6 (11) 5 7 6 (15) 7 5 6 (19) 9 3 6
(4) 198 (8) 3 7 8 (12) 5 5 8 (16) 7 3 8 (20) 9 1 8
Thus, there are 20 such numbers.

Example 8: The least number of numbers to be deleted from the set {1, 2, 3, ………,13, 14, 15} so that the
product of the remaining numbers is a perfect square is
(A) 1 (B) 2 (C) 3 (D) 4
Solution: The product of all the numbers from 1 to 15 (i.e. 15!) is 1 × 2 × 3 × 53 × 72 × 111 × 131
11 6

= 2 × 210 × 36 × 53 × 72 × 111 × 131

= 1 × 210 × 36 × 52 × 72 × 10 × 11 × 13
When the numbers from 1 to 15 expressed as a product of even powers of prime numbers,
the numbers 10, 11, 13 have odd powers. So these three numbers to be deleted so that the
product of other numbers become a perfect square.

Example 9: A number is formed by writing the first 10 primes in the increasing order. Half of the digits
are now crossed out, so that the number formed by the remaining digits without changing
the order, is as larger as possible.
The second digit from the left of the new number is
(A) 2 (B) 3 (C) 5 (D) 7
Solution: The initial number is 2357111317192329. This has 16 digits, 8 of which are to be deleted. To
get the largest number the leading digits should be as large as possible. Starting with 9 there
can be only at the most 5 digits. So 9 can neither the first digit nor the second digit. The
first two digits can be 7. The largest possible new number is 77192329.

Example 10: Let n be the number of integers less than 10,000 which are divisible by all integers from 2
to 10. Then
(A) n = 0 (B) 1  n  5 (C) 5  n  10 (D) 10  n  15
Solution: The numbers divisible by all the integers from 2 to 10 are the multiples of the LCM of all the
integers from 2 to 10 which is 8 × 9 × 5 × 7 = 2520.
So, the multiples of 2520 less 10,000 are
2520, 2 × 2520 = 5040, 3 × 2520 = 7560
Thus there are exactly three numbers less than 10,000 and divisible by all integers from 2
to 10.

Example 11: The number of primes less than 100 but having 7 as the unit digits is
(A) 6 (B) 7 (C) 8 (D) 9
Solution: The numbers less than 100 but having “7” as the unit digit are 7, 17, 27, 37, 47, 57, 67, 77, 87
and 97.
27, 57, 77, and 87 are composite numbers whereas the numbers 7, 17, 37, 47, 67 and 97 are
primes.
They are 6 in numbers.

NUMBER SYSTEM 16
Example 12: The number of two digit numbers whose digit sum is divisible by 6 is
(A) 13 (B) 8 (C) 7 (D) 22
Solution: The sum of the digits of such two digit numbers can be 6, 12 or 18.
 The numbers 15, 24, 33, 42, 51 give a digit sum 6, the numbers 39, 48, 57, 66, 75, 84,
93 give a digit sum 12 and 99 gives a digit sum 18.
 There are (5 + 7 + 1) = 13 such 2 digit numbers.

Example 13: The number of ordered triples (a, b, c) 1  a, b, c  9 such that ac = b2 – 1 is

(A) 9 (B) 7 (C) 14 (D) 18
Solution: ac = b – 1  a × c = (b – 1) (b + 1) with this property we find that any 2 consecutive numbers,
2

satisfy the condition ; the ordered triples are (1, 2, 3), (3, 2, 1), (2, 3, 4), (4, 3, 2), (3, 4, 5), (5,
4, 3), (4, 5, 6), (6, 5, 4), (5, 6, 7), (6, 7, 8), (8, 7, 6), (7, 8, 9), (9, 8, 7). Again we have (1, 3, 8), (8,
3, 1), (3, 5, 8) and (8, 5, 3).
Thus, there are 18 ordered triples satisfying the given conditions.

Example 14: The tens place of two three-digit numbers is 8 and both the numbers are divisible by 4.
Then the difference between the biggest and the smallest such numbers is
(A) 888 (B) 808 (C) 708 (D) 788
Solution: The smallest three-digit number with 8 in the tens place and divisible by 4 is 180 and the
biggest such number is 988. So the differences is 988 – 180 = 808.

Example 15: The number 111 ….. 1111 is a 2009 digit number. It is multiplied by 2009. The third digit from
the left of the product is
(A) 1 (B) 2 (C) 3 (D) 9
Solution: The actual multiplication of the 2009 digit number 111 …. 1111 is shown below.
1111 …… 111 × 2009
9999 … 9999
00000 … 000
2222222 … 2
2232222 …. 21999
The carry over 1 by adding 9 + 2 starts from the 5th place from the right. The carry over 1
from the 4th place from the left is adding to the digit 2, and there are no more carry overs.
The product is
2232222 . . . . 21999
all these digit are 2

So, the third digit from the left is 3.

Example 16: The remainder when the number

(2 × 3 × 4 × 2007 × 2008 × 2009) – 2008 is divided by 2009 is
(A) 0 (B) 2008 (C) 1 (D) 2007
Solution: 2 × 3 × 4 × 2007 × 2008 × 2009 – 2008 = 2 × 3 × 4 × 2007 × 2008 × 2009 – 2009 + 1
= 2009 × [2 × 3 × 4 × 2007 × 2008 – 1] + 1
2009 divides 2009 [2 × 3 × 4 × 2007 × 2008 – 1]. Hence when the given number is divided by
2009, this remainder is 1.

Example 17: A certain number n is divisible 21, 28 and 49. The smallest possible value of n is …..
Solution: ‘n’ is divisible by 21, 28 and 49. So n I s divisible by the prime numbers 2, 3 and 7, the greatest
power of these numbers in the divisors of N are 2, 1 and 2 respectively. So the least value
of N is 22 × 31 × 72 = 588.
NUMBER SYSTEM 17
Example 18: Using the digits 2 and 7, and addition or subtraction operations only, the number 2010 is
written. The maximum number of 7 that can be used, so that the total numbers used is a
minimum is
(A) 284 (B) 286 (C) 288 (D) 290
Solution: 2010 = 7 × 287 + 1 gives
2010 = 7 + 7 + 7 +  + 7 + 1 + 2 + 2 + 2 + 2
286 times 4 times

The number of digits used being 287 + 1; but only the digits 7 and 2 are to be used.
 2010 = 7 × 286 + 4 × 2
= 7 + 7 + 7 ++ 7 + 1 + 2 + 2 + 2 + 2
286 times 4 times

The total number used is 290.

Again 2010 = 7 × 288 – 3 × 2
= 7 + 7 + 7 ++ 7 + 1 + 2 + 2 + 2 + 2
286 times 3 times

Total numbers used have is 288 + 3 = 291 > 290

In (ii), we use 286 sevens and the total number of digits used is 290 which is the minimum.

1 1 1
Example 19: + = where a, b are natural numbers.
a b 13
(1) a = b = 26 (2) a = 13, b = 13 × 14
(3) a = 14, b = 13 × 14
Of these statements the correct statement are
(A) (A) and (B) (B) (A) and (C) (C) (B) and (C) (D) (A) (B) and (C)
1 1 1
Solution: + =
a b 13
(1) a = b = 26 gives
1 1 2 1
+ = = is a correct statement or true statement
26 26 26 13
(2) a = 13, b = 13 × 14
1 1 1 1 14 + 1 15 1
+ = + = = 
a b 13 13  14 13  14 13  14 13
 it is false
(3) a = 14, b = 13 × 14
1 1 1 1 13 + 1 14 1
+ = + = = =
a b 14 13  14 13  14 13  14 13
(1) true statement, So (1) and (3) are the correct statements.

Example 20: A number is called a palindrome if it reads the same forward of backward. For example
13531 is a palindrome. The difference between the biggest 10 digit palindrome and the
smallest 9 digit palindrome is
(A) 976666666 (B) 9888888888 (C) 9899999998 (D) 977777777
Solution: The biggest 10 digit palindrome number is 999...99

The smallest 9 digit palindrome number is 1000...01

7 times

The difference is 989...9998

7 times

NUMBER SYSTEM 18
Example 21: It is given that a and b are positive integer such that a has exactly 9 positive divisors and b
has exactly 10 positive divisors. If the least common multiple (LCM) of a and b is 4400, find
the value of |a – b.|
Solution: Since the number of positive divisors of a is odd, a must be a perfect square. As a is a divisor
of 4400 = 24 × 52 × 11 and a has exactly 9 positive divisors, we see that a = 22 × 52. Now
the least common multiple of a and b is 4400 implies that b must have 24 × 11 as a divisor.
Since 24 × 11 has exactly 10 positive divisors, we deduce that h = 24 × 11 = 176. Hence |a – b|
= 76.

Example 22: It is given that a, b and c are three positive integers such that
a2 + b2 + c2 = 2011.
Let the highest common factors (HCF) and the least common multiple (LCM) of the three
numbers a, b, c be denoted by x and y respectively. Suppose that x + y = 388. Find the value
of a + b + c.
Solution: Without loss of generally, we may assume that a  b  c. Let the HCF (or GCD) of a, b and c
be d. Then a = da1, b = db1 and c = dc1. Let the LCM of a1, b1 and c1 be m. Thus,
2011 388
a21 + b21 + c21 = and d + md = 388 or 1 + m = . So, d2 |2011 and d| 388. Not that 2011
d2
d
is a prime. Thus we must have d = 1, and it follows that a = a1, b = b1, c = c1, and thus a2 + b2
+ c2 = 2011, and a = 43, b = c = 9 is the only combination which satisfies the given conditions.
Thus we have a + b + c = 43 + 18 = 61.

Example 23: How many triples of non-negative integers (x, y, z) satisfying the equation
xyz + xy + yz + zx + x + y + z = 2012?
Solution: (x + 1) (y + 1)(z + 1) = 2013 = 3 × 11 × 61.
If all x, y, z are positive, there are 3! = 6 solutions.
If exactly one of x, y, z is 0, there are 3 × 6 = 18 solutions.
If exactly two of x, y, z are 0, there are 3 solutions.
6 + 18 + 3 = 27.

Example 24: Let L denote the minimum value of the quotient of a 3-digit number formed by three distinct
digits divided by the sum of its digits. Determine [L].
(where [.] denotes greatest integer function)
Solution: A three-digit number can be expressed as 100a + 10b + c, and so we are minimizing
100a + 100b + c
F (a b c ) =
a +b+c
Observe that with distinct digits a b c, F(a b c) has the minimum value when a < b < c. Thus
we assume that 0 < a < b < c  9.
Note that
100a + 10b + c 99a + 9b
F(abc) = = 1+
a +b+c a +b+c
We observe no that F(a b c) is minimum when c = 9.
99a + 9b 9(a + b + 9) + 90a − 81 9(10a − 9)
F(ab9) = 1 + = 1+ = 10 +
a +b+9 a +b+9 a +b+9
Now F(a b 9) is minimum when b = 8.
9(10a − 9) 90(a + 17) − 1611 1611
F(a 89) = 10 + = 10 + = 100 −
a + 17 a + 17 a + 17
Which has the minimum value when a = 1, and so L = F(1 8 9) = 10.5 and [L] = 10
NUMBER SYSTEM 19
Example 25: If the total number of sets of positive integers (x, y, z), where x, y and z are positive integers,
with x > y > z such that x + y + z = 203 is n, then find the sum of the digits of n.
 202  202(201)
Solution:
 2  =
First note that there are 
2
= 20301 positive integer sets (x, y, z) which satisfy
 
the given equation. These solution sets include those where two of the three values are
equal. If x = y, then 2x + z = 203. By enumerating, z = 1, 3, 5, ….., 201. There are thus 101
solutions of the form (x, x, z). Similarly, there are 101 solutions of the form (x, y, x) and (x, y,
y). Since x < y < z, the required answer is
1   202   20301 − 303
  
 − 3(101)  = = 3333
3!   2  
 6

Example 26: If a and b are positive integers such that a2 + 2ab – 3b2 – 41 = 0, find the value of a + b.
Solution: We have a2 + 2ab – 3b2 = (a – b) (a + 3b) = 41. Since 41 is a prime number, and a – b < a +
3b, we have a – b = 1 and a + 3b = 41. Solving the simultaneous equations gives a = 11 and b
= 10. Hence a + b = 21.

Example 27: What is the smallest positive integer n, where n  11. Such that the highest common factor
of n – 11 and 3n + 20 is greater than 1?
Solution: Let d > 1 be the highest common factor of n – 11 and 3n + 20. Then d | (n – 11) and d| (3n +
20). Thus d |[3n + 20 – 3(n – 11)], i.e., d | 53. Since 53 is a prime and d > 1, it follows that d =
53. Therefore n – 11 = 53k, where k is a positive integer, so n = 53k + 11. Note that for any k,
3n + 20 is a multiple of 53 since 3n + 20 = 3(53K + 11) + 20 = 53(3k + 1). Hence n = 64 (when
k = 1) is the smallest positive integer such that HCF(n – 11, 3n + 20) > 1.

Example 28: If the number of integers between 1 and 2013 with the property that the sum of its digits
equals 9 is k then find the sum of digits of k.
Solution: Case 1 : n < 1000. Write n = abc . Then
a + b + c = 9, a,b,c  {0, 1,…..,9}.
Case 2 : 1000  n < 2000. Write n = 1abc . Then
a + b + c = 8, a, b, c  {0,1,……,8}.
Case 3 : 2000  n 2013. Then n = 2007.
 9 + 3 − 1  8 + 3 − 1
Therefore, there are   +   + 1 = 55 + 45 + 1 = 101 such numbers.
 9   8 

Example 29: Let A be a 4-digit integer. When both the first digit (left-most) and the third digit are
increased by n, and the second digit and the fourth digit are decreased by n, the new number
is n times A. Find the sum of digits of A.
Solution: 18
Let the 4-digit number be A = abcd . Then
1000(a + n) + 100(b – n) + 10(c + n) + (d – n) = nA.
It gives A + 909n = nA; or equivalently, (n – 1)A = 909n.
Note that (n – 1) and n are relatively prime and 101 is a prime number. We must have
(n – 1) is a factor of 9. So n = 2 or n = 4.
If n = 4, then A = 1212, which is impossible since b < n. So n = 2 and A = 909 × 2 = 1818.

NUMBER SYSTEM 20
 Exercise – 2.3

1. The sum of the digits of the number 10n – 1 is 3798. The value of n is
(A) 431 (B) 673 (C) 422 (D) 501

2. a, b, c, d are natural numbers such that a = bc, b = cd, c = da and d = ab. Then (a + b) (b + c) (c +
d) (d + a) is equal to
(A) (a + b + c + d)2 (B) (a + b)2 + (c + d)2 (C) (a + d)2 + (b + c)2 (D) (a + c)2 + (b + d)2

3. A three digit number with digits A, B, C in that order is divisible by 9. A is an odd digit and C is an
even digit. B and C are non zero. The number of such three digit number is
(A) 4 (B) 8 (C) 16 (D) 20

4. Nine numbers are written in ascending order. The middle number is also the average of the nine
numbers. The average of the 5 larger numbers is 68 and the average of the 5 smaller numbers is
44 . The sum of all the numbers is
(A) 540 (B) 450 (C) 504 (D) 501

5. If the average of 20 different positive integers is 20 then the greatest possible number among these
20 numbers can be
(A) 210 (B) 200 (C) 190 (D) 180

6. If a, b are natural numbers such that a + b = 2008, then (–1)a + (–1)b is

(A) 1 (B) –1 (C) 2 (D) 2 or –2

7. The number 1612 is obtained from the number 84 by raising the smaller number to the power n. Then
n is
16 8
(A) 3 (B) 4 (C) (D)
3 3

8. The remainder when the number

(2 × 3 × 4 × 2012 × 2013 × 2014 × 2015) – 2008 is divided by 2015 is
(A) 1 (B) 2008 (C) 7 (D) 2007

2004
 1
9. The last digit in the finite decimal representation of the number   is
5
(A) 8 (B) 6 (C) 4 (D) 2

10. A natural number n has exactly two divisors and (n + 1) has three divisors. The number of divisors
of (n + 2) is
(A) 2 (B) 3 (C) 4 (D) depends on the value of n

11. The sum of two natural number is 100. Which of the following can be the greatest product of the
numbers.
(A) 1000 (B) 4000 (C) 2500 (D) 900

12. A computer is printing a list of the seventh powers of all natural numbers, that is the sequence 17,
27, 37,…… . The number of terms (or numbers) between 521 and 428 are
(A) 12 (B) 130 (C) 14 (D) 150
NUMBER SYSTEM 21
13. For a positive integer k, we write
(1 + x)(1 + 2 x)(1 + 3x) (1 + kx) = a0 + a1 x + a2 x 2 + + ak x k
where a 0 , a1 , , a k are the coefficients of the polynomial. Find the sum of all the digits of smallest
possible value of k if a0 + a1 + a2 + + ak −1 is divisible by 2005.

14. The smallest three-digit number n such that if the three digits are a, b and c , then
n =a + b + c + ab + bc + ac + abc.
n +1
Evaluate .
5

15. What is the largest positive integer n satisfying n200 < 5300?

NUMBER SYSTEM 22
 2.4 Surds

Definitions
For an even positive integer n, by the notation n a , where a  0, we denote the non-negative real
number x which satisfies the equation xn =a. In particular, when n = 2, 2 a i s called square root
of a, and denoted by a usually.
For odd positive integer n and any real number a, by the notation n a we denote the real number
x which satisfies the equation xn = a.
An algebraic expression containing a where a > 0 is not a perfect square number, is called
1
quadratic surd expression, like 1– 2, , etc.
2– 3

Basic Operational Rules on a

a for a  0,
( ) 
2
(i) a = a, where a  0. (ii) a2 = | a | =  0 for a = 0,
–a for a  0,

(iii) ab = |a |. |b| if ab  0.

a |a |
(Iv) = if ab  0, b  0.
b |b|

( a) =
n
(v) an if a  0.

(vi) a c +b c =(a+b) c if c  0.

Rationalization of Denominators
1 a b–c d
(i) = where a, b, c, dare rational numbers, b, d,  0 and a2b– c2d  0.
a b –c d a2b – c2d

1 a b–c d
(ii) = , where a, b, c, dare rational numbers, b, d  0 and a2b- c2d  0.
a b –c d a2b – c2d

In algebra, the expressions A+B C and A – B C , where A, B, C are rational and C is irrational,
are called conjugate surd expressions.

The investigation of surd forms is necessary and very important in algebra, since surd forms and
irrational number have close relation. For example, all the numbers of the form n,n N are
irrational if the positive integer n is not a perfect square. In other words, the investigation of surd
from expression is the investigation of irrational numbers and their operations essentially.

Basic Methods for Simplifying Compound Surd Forms

(I) Directly simplify according to algebraic formulas: like

(a +b) (a +b)
2 4
=|a +b|, = (a +b)2 , 3 (a + b)3 = a + b,etc

(ii) Use the techniques for completing squares to change the expression inside the outermost square
root sign to a square, like the simplification of

(iii) Om Use other methods like Coefficient-determining method, substitutions of variables, etc.

NUMBER SYSTEM 23
 Solved Examples 2.4

c+2– c+1 c+2– c+1 c – c-1

Example 1: Given that c > 1 and x = ,y = ,z =
c – c-1 c+1– c c+2– c+1
arrange x, y, z in ascending order.
Solution: From
( c + 2)2 – ( c + 1)2  ( c + c – 1)
c+2– c+1 c + c–1
x= =  =
c – c–1 ( c + 2 + c + 1) ( c) – ( c – 1) 
2 2
c+2+ c+1
 
( c + 2)2 – ( c + 1)2  ( c + 1 + c)
c+2– c+1 c+1+ c
y= =  =
c+1– c ( c + 2 + c + 1) ( c + 1) – ( c) 
2 2
c+2+ c+1
 
it follows that x < y. Further,
( c)2 – ( c - 1)2  ( c + 2 + c + 1)
c – c–1
z= =  
c + 2 – c + 1 ( c + c – 1) ( c + 2)2 – ( c + 1)2 
 

c+2+ c+1
= .
c + c–1

Since c + c - 1 < c + 1 + c < c + 2 + c + 1, thus x < y < z.

7+ 3 7- 3
Example 2: Given x = ,y = , fmd the value of x4 + y4 + (x + y)4.
7- 3 7+ 3
Solution: Here an important technique is to express to x4 + y4 + (x + y)4 by x + y and xy
instead of using the complicated expression of x and y. From
1 1 1
= ( 7 + 3)2 = (10 + 2 21) = (5 + 21),
7-3 4 2
1 1 1
y= ( 7 – 3)2 = (10 – 2 21) = (5 – 21)
7–3 4 2
it follows that x + y = 5 and xy = 1. Therefore
x4 + y4 + (x + y)4
= (x2 + y2)2 - 2x2y2 + 54 = [(x + y)2 - 2(xy)]2 – 2(xy)2 + 625
= 232 – 2 + 625 = 527 + 625 = 1152.

2+ 3– 5
Example 3: Simplify the expression by rationalizing the denominator.
2+ 3+ 5

2+ 3– 5 2 5
Solution: =1 =1
2+ 3+ 5 2+ 3+ 5

= 1–
2 5 ( 2+ 3+ 5 ) = 1 2( 10 + 15 –5 )
( )
2
2 + 3 –5 2 2. 3

1– 10 + 15 –5 60 + 90 –5 6
=1 =
6 6

15 10 5 6
=1– − +
3 2 6
NUMBER SYSTEM 24
Example 4: Simplify S = x2 +2x+ 1– x2 +4x+4 + x2 –6x+9

Solution: From S = x2 +2x+ 1– x2 +4x+4 + x2 –6x+9 =

I x + 1 I – I x + 2 I + I x – 3 I, there are four possible cases as follows:
(i) When x  –2, then S = – (x + 1) + (x + 2) – (x – 3) = – x + 4.
(ii) When –2 < x  –1, then S = – (x + 1) – (x + 2) – (x - 3) = – 3x.
(iii) When- 1 < x  3, then S = (x + 1) – (x + 2) – (x- 3) = –x + 2.
(iv) When 3 < x, then S = (x + 1) - (x + 2) + (x- 3) = x- 4.

Example 5: Simplify
1 1 1 1 1
P= + + ..... + .= – ,
2 1+ 2 3 2 +2 3 100 99 + 99 100 n n+ 1
Hence
 1   1 1   1 1  1 1 9
P =  1–  +  –  + ...... +  –  = 1– = 1– = .
 2  2 3  99 1000  100 10 10

Example 6: Simplify M = 2 + –2 + 2 5 – 2– –2 + 2 5 .

Solution: Let a = 2+ –2+ 2 5 ,b= 2 – –2+ 2 5 . Then a2 + b2 = 4 and

ab= 4–(–2+ 2 5) = 6–2 5 = 5 – 1. f

( ) ( )
2
Therefore (a- b)2 = 4 – 2 5 –1 =6–2 5 = 5 –1 ,So

M=a–b= 5 –1

Example 7: Simplify )( )
(
9+ 2 1+ 3 1+ 7

Solution: Considering that 9+ 2 ( 1+ 3 )( 1+ 7 ) = 11+ 2 3 + 2 5 + 2 15, where the coefficients of the terms

of 3, 5, 15 are all2, it is natural ot use the coefficient-determining method, assume that

( )(
9+2 1+ 3 1+ 7 = a + b + c )
Taking squares on both sides yields

11+2 3 +2 5 +2 15 =a+b+c+2 ab +2 ac +2 bc
By the comparison of coefficients, the following system of equations is
obtained:
a + b + c = 11, (1)
ab = 3, (2)
ac = 5, (3)
be= 15. (4)
(2)  (3)  (4) yields (abc) = 152, i.e., abc = 15, so a = 1 Hom (4), b = 3 from (3), and c = 5 from
2

(1). Thus,

( )(
9+2 1+ 3 1+ 7 = 7 + 3 + 5. )
NUMBER SYSTEM 25
 2
Example 8: Given that y is the nearest integer of + 3 3 , find the value of 9+ 4 y .
3 3 –1

( ) ( )( )
3
Solution: Since 2 = 3 3 –1= 3 3 –1 3 9 +3 3 + 1 ,

2
(3 3 + 1)
2
+3 3 = 3 9 +3 3 + 1+3 3 = =3 3 + 1.
3 3 –1

it is clear that 2 < 3 3 + 1 < 3. Further, (1.5)3 > 3  2.5– 3 3 + 1 = ( )

1.5–3 3  3 3 –3 3 = 0,so2  3 3 + 1  2.5, hence y = 2. Thus

( )
2
9+ 4 y = 9+ 4 2 = 8 +1 =2 2 +1

a +8 a – 1 a +8 a – 1
Example 9: Simplify 3 a + +3 a– .
3 3 3 3

a–1 a +8
Solution: Let x = , then a = 3x2 + 1 and = x2 + 3, so that the given expression can be
3 3
expressed in terms of x:

a +8 a – 1 a–1
3 a+ +3 a–
3 3 3

=3 3x2 + 1+(x2 +3)x +3 3x2 + 1–(x2 +3)x

=3 x3 +3x2 +3x+ 1 +3 1–3x+3x2 –x2 =3 (x+ 1)3 +3 (1–x)3

= (x + 1) + (1 - x) = 2.

Example 10: Find the value of 2 2 2 2..... – 2+ 2+ 2+ 2+ .....

Solution: Let x = 2 2 2 2..... y = 2+ 2+ 2+ 2+ .....

Then x satisfes the equation x2 = 2x,

and its solution is x = 2(since x > 0). Similarly, y satisfies the equation y 2 = 2 + y.
Then (y- 2) (y + 1) = 0 and y > 0 yields the solution y = 2. Thus

2 2 2 2... – 2+ 2+ 2+ 2+ ..... =– y =0.

Example 11: Given that the integer part and fractional part of 37 –20 3 are x and y

4
respectively. Find the value of x + y + .
y

Solution: 37 –20 3 = 5–2 3 = 1+ 2 2– 3 ( )

x = 1, and (
y = 2 2– 3 , )
hence

x+y+
4
= 5–2 3 +
2
= 5–2 3 + 2 2 + 3 = 9 ( )
y 2– 3 ( )
NUMBER SYSTEM 26
 13 x4 – 6x3 –2x2 + 18x + 23
Example 12: Suppose X = . Find the exact value of
19+8 3 x2 –8x + 15

Solution: Note that x =

13
=
(
13 4– 3 ) = 4– 3. So (x- 4)2
(4 + 3 ) (4– 3 )(4 + 3 )
2

= 3. That is, x2- 8x + 15 = 2.

It follows that
x4 –6x3 –2x2 + 18x + 23 38–20x
= x2 + 2x – 1 +
x –8x + 15
2
x – 8x + 15
2

38–20x
= x2 + 2x – 1+
2
= x2– 8x + 18
= 2 + 3 = 5.

NUMBER SYSTEM 27
 EXERCISE - 2.4

1+ 2 + 3
1. Simplify by rationalizing the denominator.
1– 2 + 3

x2–4x + 3+ (x – 1) x2 –9
2. Simplify the expression , where x > 3..
x2 + 4x + 3+ (x – 1) x 2 – 9

3. Evaluate

( 5+ 6+ 7 )( 5+ 6– 7 )( 5– 6+ 7 – 5+ 6 7 .)( )
4. Suppose that a = 6 –2andb=2 2 – 6. Then

(A) a > b, (B) a = b, (C) a < b, (D) b = 2a, (E) a = 2b

5. Arrange the three values a = 27 – 26,b= 28 – 27,c= 29 – 28 n ascending order.

3 3
6. The number of integers x which satisfies the inequality < x< is
1+ 3 5– 3

(A) 2, (B) 3, (C) 4, (D) 5, (E) 6.

1 1 2
7. Calculate the value of + + .
1– 4 5 1+ 4 5 1+ 5

8. Given a > b > c > d > 0, and U = ab + cd,V= ac + bd+W= ad, + bc. se "<" to connect U,V,W.

–1
 4 2 1
9. Simplify 3 3 3  –3 +3  .
 9 9 9 


3 3 1
10. Given a = 3 4 +3 2 + 1 , find the value of + +
a a2 a3

11. Given x + y = 3 5 – 2, x – y = 3 2 – 5, find the value of xy.

12. Evaluate a + 3+ 4 a – 1 + a + 3–4 a – 1.

( ) ( )
5 5
a–1– a a–1+ a
13. Simplify +3
a–1+ a a – a–1

14. Simplify 1+a2 + 1+a2 +a 4 .

1 x + 2 + x2 + 4x
15. Given x= a– , find the value of
a x + 2– x2 + 4x

NUMBER SYSTEM 28
 2.5 Congruence of integers

Definition 1

When an integer n is divided by a non-zero integer m, there must be an integral quotient q and a
remainder r, where 0  I r I < m. This relation is denoted by n = mq + r, and the process for getting
this relation is called division with remainder.

Definition 2

Two integers a and bare said to be congruent modulo m, denoted by a= b (mod m), if a and b
have the same remainder when they are divided by a non-zero integer m. If the remainders are
different, then a and bare said to be not congruent modulo m, denoted by a  b (mod m).

By the definition of congruence, the following four equivalent relations are obvious:

a  b (mod m)  a- b = km  a- b  0 (mod m)  m I (a- b).

Basic Properties of Congruence

(i) If a  b (mod m) and b  c (mod m), then a = c (mod m).

(ii) If a  b (mod m) and c  d (mod m), then

(a + c)  (b + d) (mod m), (a- c)  (b- d) (mod m).

(iii) If a  b (mod m) and c  d (mod m), then a· c  b · d (mod m).

(iv) If a  b (mod m) then an  bn (mod m) for all natural numbers n.

(v) I f ac  be (mod m) and (c, m) = 1, then a  b (mod m).

The Units Digit of Powers of Positive Integers a

Let P be the units digit of a positive integer a, and n be the positive integer power of a. Then the
units digit of an is determined by the units digits of pn, denoted by U(Pn), and the sequence {U(Pn),
n = 1,2,3,...} follows the following rules:

(I) The sequence takes constant values for P = 0, 1,5 ,6, i.e., U(Pn) does not change as n
changes.

(II) The sequence is periodic with a period 2 for P = 4 or 9.

(III) The sequence is periodic with a period 4 for P = 2 ,3, 7 ,8.

The Last Two digits of some positive integers

(I) The last two digits of 5n (n  2) is 25.

(II) The ordered pair of last two digits of 6n (n  2) changes with the period "36, 96, 76,56" as
n changes.

(III) The ordered pair of last two digits of 7n (n  2) changes with the period "07,49,43,01" as n
changes.

(iv) The ordered pair of last two digits of 76n is always 76.

NUMBER SYSTEM 29
Decimal Representation of Integers

Definition

The decimal representation of integers is the number system that takes 10 as the base. Under
this representation system, an (n + 1)-digit whole number (where n is a non-negative integer)
N=anan–1 ...a 1a0 means

N = an  10n + an-1  10n–1 + ... + a1  10 + a0.

The advantage of the representation is that a whole number is expanded as n + 1 independent parts,
so that even though there may be unknown digits, the operations of addition, subtraction and
multiplication on integers can be carried out easily.

Decimal Expansion of Whole Numbers with Same Digits or Periodically Changing Digits

a
aaa...a =a(10n–1 + 10n–2 + ... + 10+ 1)= (10n – 1).
n
9

(n–1) (n–2) abc

abcab...abc = abc(103 + 103 + .... + 103 + 1) = (103n – 1).
n of abc
999

NUMBER SYSTEM 30
 Solved Examples 2.5

Example 1: When a three digit number is divided by 2 ,3,4,5 and 7, the remainders are all 1. Find the
minimum and maximum values of such three digit numbers.
Solution: Let x be a three digit with the remainder 1 when divided by 2,3,4, 5 and 7. Then x- 1 is
divisible by each of 2 ,3,4,5, 7, SO X- 1 = k. [2,3,4,5, 7] = 420k.
Thus, the minimum value of x is 420 + 1 = 421, the maximum value of x is 2  420 + 1 = 841.

Example 2: It is known that 2726,4472,5054,6412 have the same remainder When they are divided by
some two digit natural number m. Find the value of m.
Solution: For excluding the effect of the unknown remainder, the three differences by the four given
numbers can be used to replace the original four numbers. Then
m I (4472- 2726)  m I 1746. 1746 = 2-32. 97;
m I (5054- 4472)  m I 582. 582 = 2. 3. 97;
m I (6412- 5054)  m I 1358 1358 = 2.7.97.
Since 97 is the unique two digit common divisor of the differences, so
m = 97.

Example 3: Find the remainder of 32000 when it is divided by 13.

Solution: 33 = 27  1 (mod 13) provides the method for reducing the power of 3, it follows that 32000 
(33)666. 32  32  9 (mod 13).
Thus, the remainder is 9.
Note: For finding the remainder of a large power of a positive integer, it is important to find
the minimum power with remainder 1, or see if the remainders are constant as the power
changes.

Example 4: Find the smallest positive integer k such that 269 + k is divisible by 127.
Solution: 27  1 (mod 127) implies 27m = (27)m  1m  1 (mod 127), hence
269 = [(27)9](26)  26  64 (mod 127), therefore the minimum value of k is equal to 127– 64 =
63.

Example 5: What is the remainder when 6273 + 8273 is divided by 49?

Solution: In general, for odd positive integer n,
an + bn = (a + b) (an-1 - an-2b + an-3b2 .... + bn-1) = 14, so that
6273 + 8273 = (6 + 8) (6272 – 6271. 8 + 6270. 82 – ... + 8272) = 14M, where M = 6272 – 6271.8 + 6270.82 –
... +8272.
Furthermore,
M  (–1)272 –(–1)271 + (–1)270 – .... + 1  273  0 (mod7),
273 terms

therefore 7 I M, hence 49 I 14M, i.e. the remainder is 0.

2009
Example 6: Find the remainder of the number 20052007 when divided by 7.
2009 2009
Solution: First of all 20052007  32007 (mod 7). Since 33  -1 (mod 7) yields 36  (33)2  1 (mod 7),
20072009  32009  3 (mod 6),
it follows that 20072009 = 6k + 3 for some positive integer k. Therefore
2009 6k + 3
20052007 3  33  6(mod7).
Thus, the remainder is 6.
NUMBER SYSTEM 31
Example 7: Find the smallest whole number such that its first digit is 4, and the value of the number
obtained by moving this 4 to the last place is 1/4 of the original value.
Solution: Suppose that the desired whole number N has n + 1 digits, then N = 4 .10n + x where x
is an n-digit number.
From assumptions in question
4(10 x + 4) = 4. 10n + x, i.e., 39 x = 4 (10n- 4) = 4. 99....96
n– 1

 13 x = 4. 33....32,and13|33....32.
n– 1 n– 1

By checking the cases n = 1,2, ... one by one, it is easy to see that the minimal value of n is
5: 33332  13 = 2564.  x = 4 x 2564 = 10256, and N = 410256.

Example 8: A positive integer is called a "good number" if it is equal to four times of the sum of its
digits. Find the sum of all good numbers.
Solution: If a one digit number 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 non digit good
number exists if n  4. Thus, the sum of all good numbers is 120.

Example 8: Let abcdef be a 6-digit integer such that defabc is 6 times the value of abcdef . Find the
value of a + b + c + d + e + f.
Solution: From assumption in the question,
(1000)(def) + abc = 6[(1000)(abc) + def].

(994)(def) =(5999)(abc)

(142)(def) = (857)(abc)

Therefore 587 |(142) (def) Since 857 and 142 have no common factor greater than 1, so 8571 |

(def) Since 2 x 857 > 1000 which is not a three digit number, so (def) = 857. Thus,abc = 142,
and a + b + c + d + e + f = l + 4 + 2 + 8 + 5 + 7 = 27.

Example 10: Prove that each number in the sequence 12; 1122; 111222; ..... is a product of two consecutive
whole numbers.
Solution: By using the decimal representation of a number with repeated digits, we have
1 2 1
11....11 22....22= (10n – 1). (10n – 1) = (10n – 1)(10n + 2)
n
9 9 9
n

 10n – 1   10n + 2   10n – 1   10n – 1  1

= . = .  = A. (A + 1), where A = (10n –1)=33....33 is a whole
 3   3   3   3  3
        n

number. The conclusion is proven.

NUMBER SYSTEM 32
Example 11: 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,cabandcba , 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 abc, if N = 3194.

Solution: Let S = N + abc = abc + acb + bca + bac + cab + cba, then
S = (100a + 10b + c) + (100a + 10c + b) + (100b + 10a + c) +(100b + 10c + a) + (100c + 10a + b)
+ (100c + 10b + a) = 222 (a + b + c):
3194 = N = 222 (a + b +c) abc implies 222(a + b +c) = 3194 + abc = 222 x 14 + 86 + abc .
Hence
(i) a + b + c > 14;
(ii) 86 + abc is divisible by 222, i.e., abc + 86 = 222n for some positive integer n.
1085
Since 222n  999 + 86 = 1085, son  < 5, hence n may be one of 1, 2, 3, 4.
222
When n = 1, then abc = 222-86 = 136, the condition (i) is not satisfied.
When n = 2, then abc = 444- 86 = 358, the conditions (i) and (ii) are satisfied.
When n = 3, then abc = 666-86 = 580, the condition (i) is not satisfied.
When n = 4, then abc = 888- 86 = 802, the condition (i) is not satisfied.
Thus, abc = 358.

Example 12: Find the smallest natural number n which has the following properties:
(a) Its decimal representation has 6 as the last digit.
(b) If the last digit 6 is erased and placed in front of the remaining digits, the resulting
number is four times as large as the original number n.
Solution: It is clear that n is not a one-digit number. Let n = 10 x + 6, where x is a natural number of
m digits. Then 6·10m + x = 4 (10 x + 6))  39 x = 6·10m– 24  13x = 2·10m– 8, so 13| (2·10m– 8)
for some m, i.e., the remainder of 2·10m is 8 when divided by 13. By long division, it is found
that the minimum value of m is 5. Thus,
2.10m –8 199992
x= = = 15384,n= 153846
13 13

Example 13: Find all the three digit number n satisfying the condition that if 3 is added, the sum of digits
of the resultant number is 1/3 of that of n.
Solution: Let n = abc . By assumption the carry of digits must have happened when doing the addition
abc + 3, therefore c  7.
By S0 and S1 we denote the sum of digits of nand the resultant number respectively.
Three cases are possible:
(i) If a = b = 9, then S0  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 2007.
NUMBER SYSTEM 33
 EXERCISE - 2.5

1. Prove that 7 I (22225555 + 55552222).

27
2. Find the remainder of 4737 when it is divided by 11.

3. What is the remainder when 91990 is divided by 11?

4. When a positive integer n is divided by 5, 7, 9, 11, the remainders are 1, 2, 3, 4 respectively. Find the
minimum value of n.

5. Find the last two digits of 2999.

6. Find the remainder of (25733 + 46)26 when it is divided by 50.

7. What is the smallest positive integer n > 1 such that 3n ends with 003?

8. Find all the positive integers n, such that n · 2n + 1 is divisible by 3.

9. Prove that when abc is a multiple of 37, then so is the number bca.

10. Find all positive integers with initial digit 6 such that the integer formed by deleting this 6 is 1!25 of
the original integer.

11. Let x be a 3-digit number such that the sum of the digits equals 21. If the digits of x are reversed,
the number thus formed exceeds x by 495. What is x?

12. Given that a four digit number nand the sum of all digits of n have a sum 2001. Find n.

13. When N = 11......11 11......11 , what is the sum of all digits of N?

1989 digits 1989 digits

14. Find the maximum value of the ratio of three digit number to the sum of its digits.

15. Find all the three digit numbers n = abc such that n = (a+ b + c)3.

NUMBER SYSTEM 34
 2.6 Perfect square numbers

Definition
A whole number n is called a perfect square number (or shortly, perfect square), if there is an
integer m such that n = m2.

Basic properties of perfect square Number

(i) The units digit of perfect square can be 0,1,4,5,6, and 9 only.
It suffices to check the property for 02,12,22,….92.

  
(ii) It the prime factorization of a natural n is p1 1 p2 2 .....p2 k , then i ns a perfect square  each 1 is even
 (n) is odd; where (n) denotes the number of divisors of n.

(iii) For any perfect square number n, the number of its tail zeros (i.e., the digit 0s on its right end)
must be even, since in the prime factorization of n the number 2 and that of factor 5 are both even

(iv) n2  1 or 0 modulo 2,3,4 It suffices to check of the forms (2m)2 and (2m + 1)2 by taking modulo 2
and modulo 4 respectively; the number of the forms of (3m)2 and (3m )2 by taking modulo 3.

(v) n2 = 0,1 or 4 (mod 8).

(vi) An odd perfect square number must have even tens digit
(if one digit perfect squares 12 and 32 are considered as 01 and 09 and respectively)
It is easy to see the reasons: For n > 3, n2 = (10a + b)2 = 100a2 + 20ab + b2. The number 1000a2 +
20ab has units digit 0 and an even tens digit. If b is an digit, the tens digit carried from b 2 must be
even, so then tens digit of n2 must be even.

(vii) If the tens digit of n2 is odd, then units digit n2 must be 6

Continue the analysis in (VI). If the tens digit carried from b2 is odd, then b = 4 or 6 only, so b2 = 16
or 36, i.e., the units digit of n2 must be 6.

(viii) There is no perfect square number between any tow consecutive square numbers K 2 and (k + 1)2,
where k is any non-negative integer.
Otherwise, there is a third integer between the tow consecutive integers K and K + 1, however, it is
impossible.
The basic problems involving perfect square number are (i) identifying if a number is a perfect
square; (ii) to find perfect square number some conditions on perfect squares; (iii) to determine the
existence of integer solutions of equations by use of the properties of perfect square numbers.

NUMBER SYSTEM 35
 Solved Examples 2.6

Example 1: In the following listed number, the one which must not be a perfect square is
(A) 3m2 – 3n + 3, (B) 4n2 + 4n + 4,
(C) 5n2 – 5n – 5, (D) 7n2 – 7n + 7
(E) 11n2 + 11n – 11.
Solution: 3n2 – 3n + 3 = 3(n2 – n + 1) which is 32 when n = 2;
5n2 – 5n – 5 = 5(n2 – n + 1) = 52 when n = 3;
7n2 – 7n + 7 = 7(n2 – n + 1) = 72 when n = 3;
11n2 + 11n – 11 = 11(n2 + n – 1) = 112 when n = 3.
Therefore (A), (C), (D) and (E) are all not the answer. On the other hand,
(2n + 1)2 = 4n2 + 4n + 1 < 4n2 + 4n + 4 < 4n2 + 8n + 4 = (2n + 2)2
Implies that 4n2 + 4n + 4 is not a perfect square. Thus the answer is (B).

Example 2: Given that five digit number 2x9y1 is a perfect square number. Find the value 3x + 7y.

Solution: We use estimation method to determine x and y. Let A 2 = 2x9y1 . Sine 1412 = 19881 < A2 and
1752 = 360625 > A2, so 1412 < A2 < 1752. The units digit of A2 is 1 implies that units digit of A is
1 or 9 only.
Therefor it is sufficient to check 1512, 1612, 1712, 1592, 1692 only, so we find that 1612 = 25921
satisfies all the requirements, and other number cannot satisfy all the requirements. Thus,
x = 5, y = 2, so that 3x + 7y = 15 + 14 = 29.

Example 3: Find the number of the pairs (x, y) of tow positive integers, such that N = 23x + 92y is a
perfect square number less than or equal to 2392.
Solution: N = 23x + 92y = 23(x + 4y) and 23 is a prime number implies that x + 4y = 23m 2 for some
positive integer m, so
2392 104
N = 232m2  2392  m2  = < 5.
23 2
23
Hence m = 1 or 4, i,e., m = 1 or 2.
2

When m2 = 1, then x + 4y = 23 or x = 23 – 4y. since x, y are tow positive integers, so y =

1,2,3,4,5 and x = 19, 15, 11, 7, 3 correcspondingly.
When m2 = 4, then x + 4y = 92 or x = 4y, so y can take each positive integer value form 1
through 22, and x then can take the corresponding positive values by = 92 – 4y.
Thus, the number of qualified pairs (x, y) is 5 + 22, i.e., 27.

Example 4: Prove that 2006 cannot be expressed as the sum of ten odd perfect square numbers.
Solution: We prove by contradicution. Suppose that 2006 can be expressed as the sum of ten odd
perfect square numbers. i.e.,
2006 = x21 + x22 + ..... _ x210 ,
Where x1, x2,….,x10 are all odd numbers. When taking modulo 8 to both sides, the left hand
side is 6, but the right hand side is 2, a contradiction! Thus, the assumption is wrong, and
the conclusion is proven.

Example 5: Find all the natural number n such that n2 – 19n + 91 is a perfect number.
Solution: (i) When n > 10, then n – 9 > 0, so
n2 – 19n + 91 = n2 – 20n + 100 + (n – 9) = (n – 10)2 + (n – 9) > (n – 10)2,
and

NUMBER SYSTEM 36
 n2 – 19n + 91 = n2 – 18n + 81 + (10 – n) < (n – 9)2,
so (n – 10)2 < n2 – 19n + 91 < < (n – 9)2, which implies that n2 – 19n + 91 is not a perfect
square.
(ii) When n < 9, then
N2 – 19n + 91 = (10 – n)2 + (n – 9) < (10 – n)2
and
n2 – 19n + 91 = (9 – n)2 + 10 – n (9 – n)2
So (9 – n)2 n2 – 19n + 91 < (10 – n)2, i.e., ne – 19n + 91 cannot be a perfect square.
(iii) When n = 9, then n2 – 19n + 91 = (10 – 9)2 = 1; when n = 10, then
n2 – 19 + 19 = (10 – 9)2 = 1
Thus, n2 – 19 + 91 is a perfect square if and only if n = 9 or 10.

Example 6: Let x = 1000...001000...00500..

2011 times 2012 times

If x – k is a perfect square, where k  {15, 25, 50,75}, then find the value of k.
Solution: Note that
X = (101012 + 1)  102014 + 50 = 104026 + 102014 + 50
= (102013)2 + 2  102013  5 + 50 = (102013 + 5)2 + 25.
So x – 25 is a perfect square.

NUMBER SYSTEM 37
 EXERCISE – 2.6

1. If (x – 1) (x + 3) (x – 4) (x – 8) + m is a perfect square, then m is

(A) 32 (B) 24 (C) 98 (D) 196

2. If n + 20 and n – 21 are both perfect squares where n is a natural number, find n.

3. Find the maximal integer x such that 427 + 410000 + 4x is perfect square.

4. Prove that for any positive integer n, n4 + 2n3 + 2n + 1 is not a perfect square.

5. Prove that. there is no three digit abc, suchthat abc + cab is a perfect square.

6. Prove that the equation a2 + b2 – 8c = 6 has no integer solution.

7. Given that p is a prime number, and the sum of all positive divisors of p 4 is a perfect Square. Find
the number of such primes p.

8. If x and y are positive integers, prove that the values of x2 + y + 1 and y2 + 4x + 3 cannot both be
perfect squares at the same time.

9. Let d be any positive integer not equal to 2, 5, or 13. Show that one can find distinct a, b in the set
{2, 5, 13, d} such that ab–1 is not a perfect square.

10. Prove that the number 3n + 2  17n, where n is non-negative integer, is never a perfect
square.

11. Let b be a prime number such that the next larger number is a perfect square. Find the sum of all
such prime number.
(For example, if you think that 11 and 13 are two such prime numbers, then sum is 24.)

12. The value of greatest integer N such that

N  20072 –20070 + 31.

N– 2
Find
100

13. Find the sum of all the digit of largest N such that N + 496 and N + 224 are perfect squares.

14. The sum of 18 consecutive positive is a perfect square. In the smallest possible value of this sum,
find the sum of first two integers?

15. Let n be the smallest positive integer such that n is divisible by 20, n2 is a perfect cube, and n3 is a
perfect square. The number n contains N digits. What is N2?

NUMBER SYSTEM 38
 2.7 [X] and {X}

2.7 Greatest Integer function [x] and fractional part function {x}
Definition 1
For any real number x, the largest integer less than or equal to x, denoted by [x], is called the
integer part of x, when x is considered as a variable, the function f(x) = [x],  R is called the Gaussian
function.

Definition 2
For any real number x, the value x – [x] denoted by {x}, is called the decimal part of x.
Some Basic Properties of [x] and {x}
• 0  {x} < 1, and {x} = 0 if and if x is integer.
• x – 1 < [x]  x < [x] + 1.
• For any n  Z, [n + x] = n + [x].

–[x]– 1 if xisnot aninteger.
• [–x]= 

 –[x] if xisaninteger.

• [x + y]  [x] + [y] + for any x, y  R. In general, for x1…..,xn  R,

[x1 + x2 + …..+ xn]  [x1] + [x2] +……..+ [xn].
• [xy]  [x]. [y], where x, y  0. In general, for x1,…..,x2  0,
[x1x2…xn]  [x1] . [x2]…[xn]

 x   [x] 
•   =   for n  N, x  R.
n   n 

Theorem I. (Hermite Identity) For any x  R and n  N.

 1   2  n– 1 
[x]+ x +  + x +  + ..... + x +  =[nx].
 n  n  n 

Proof. Define the auxiliary function

 1   2  n– 1 
f (x) =[x]+ x +  + x +  + ....+ x +  –[nx].
 n  n  n 

Then if suffices to show f(x) = 0 identically. Since

 1  1   2
f  x +  = x +  + x +  + ...+[x + 1]–[nx + 1]
 n   n   n

 1   2  n– 1 
=[x]+ x +  + x +  +.... + x +  –[nx]
 n   n  n 

= f (x).
1 1
So f(x) is a periodic function with a period , hence it is enough to show f(x) = 0 for 0  x < , and
n n
this is obvious from the definition of f.

NUMBER SYSTEM 39
 Theorem II. (Legendre’ s Theorem) In the prime factorization of the product n! 1  2  3 …xn, the
index of a prime factor p is given by

n   n   n 
  +  2  +  3  + .....
p  p  p 

Proof. In n! the index of its prims factor p is the sum of the indices of prime factor p in the number

n 
1, 2,…n. Since in the n number 1 through n there are   numbers containing at least one factor p
p 

n
 2  number containing at least one factor p2,….so above sum can the total number of factor p in
p 
n!, the conclusion is proven.
Besides the problems about [x] and {x} themselves, the concepts of [x] and {x} established the
connection between x and them. So the basic problems involving [x] and contain also those from x
get [x] and {x}, or conversely, from [x] and {x} get x, i.e., solving equations with [x] and for x.
Another kind of related problems is to give some theoretical discussions involving [x] and {x}, as
indicated in Theorem I and Theorem II. But here will given some examples only belonging to the
first tow kinds of problems.

NUMBER SYSTEM 40
 Solved Examples 2.7

Example 1: Solve the equation 2[x] = x + 2{x}.

Solution: To reduce the number of variables, x [x] + {x} yields the equation
2[x] = [x] + 3{x},
 [x] = 3{x} < 3
1 2
When [x] = 0, 1, 2 respectively, then {x} = 0, , correspondingly, so the solutions are x = 0,
3 3
4 8
, .
3 3

Example 2: Find all real solutions to the equation 4x2– 40 [x] + 51 = 0

Solution: To reduce the number of variables in the given equation, x  {x} gives an inequality in x :
0 = 4x2 – 40 [x] + 51  4x2 – 40x + 51 = (2x – 3) (2x – 17)
3 17
So x . It implies that [x] may be 1, 2, …., 8
2 3
When [x] = 1, the equation becomes 4x2 + 11 = 0, no real solution for x.
29
When [x] = 2, the equation becomes 4x2 – 29 = 0, x = , which has the
2
integer part 2, hence it is a solution
69
When [x] = 3, the equation becomes 4x2 – 69 = 0, x = , which has the
2
integer part 3, a contradiction, hence no solution fox x.
109
When [x] = 4, the equation becomes 4x2 – 109 = x = > 5, a
2
contradiction, hence no solution.
149
When [x] = 5, the equation becomes 4x2 – 149 = 0 = > 6,
2
hence no solution.
189
When [x] = 6, the equation becomes 4x2 – 189 = 0 = which has
2
integer part 6, hence it is a solution.
229
When [x] = 7, the equation becomes 4x2 – 229 = 0, x = which has
2
integer part 7, hence it is a solution.
269
When [x] = 8, the equation becomes 4x2 – 269 = 0, x = which has
2
integer part 8, hence it is a solution.
29 189 229 269
Thus, the solutions are , , , .
2 2 2 2

1001. 1002..... 1985. 1986

Example 3: Find the maximum positive integer k, such that is an integer
11k
1001. 1002..... 1985. 1986
Solution: Let N = , then
11k
1000!. 1001. 1002....1985.1986 1986!
=
11k (1000!) 11k (1000!)
The highest power of 11 in 1986! is

NUMBER SYSTEM 41
  1986   1986   1986 
  +  2  +  3  = 180+ 16+ 1= 197
 11   11   11 
 1000   1000 
The highest power of 11 in 1000! is   +  2  = 90 + 8 = 98, so the
 11   11 
maximum valve of k is given by k = 197 – 98 = 99

 x   2x 
Example 4: Determine the number of real solutions of   +   = x.
2  3 
Solution: The given equation indicates that any solution x must be an integer. Let x = 6q + r, where r
= 0, 1, 2, 3, 4, 5 and q is an integer. Then the given equation becomes
 r   2r 
q+   +   =r.
2  3 
(i) r = 0 gives q = 0, sox= 0 is a solution.
(ii) r = 1 gives q = 1, sox= 7 is a solution.
(iii) r = 2 gives q = 0, sox= 2 is a solution.
(iv) r = 3 gives q = 0, sox= 3 is a solution.
(v) r = 4 gives q = 0, sox= 4 is a solution.
(vi) r = 5 gives q = 0, sox= 5 is a solution.
Thus, there are a total of 6 real solutions.

Example 5: Let x, y, z be three positive real numbers such that

x + [y] + {z} = 13.2 (1)
[x] + {y} + z = 14.3 (2)
{x} + y + [z] = 15.1 (3)
where [a] denotes the greatest integer  a and {b) denotes the fractional part of b (for
example, [5.4] = 5, {4.3} = 0:3). Find the value of x.
Solution: (1) + (2) + (3) yields 2(x + y + z) = 42.6, i.e.,
X + y + Z = 21.3 (4)
(4)- (1) gives {y} + [z] = 8.1, therefore [z] = 8 and {y} = 0.1.
Then (2) gives [x] + z = 14.2, so {z} = 0.2 and z = 8.2 which gives [x] = 6.
(1) gives x + [y] = 13, sox is an integer, i.e. x = [x] = 6.

Example 6: Let S =  1  +  2  + .... +  1988  . Find [S]

     
Solution: For any positive integer k and x, the following relations are equivalent
 x  =k  k2  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,
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 .
 

NUMBER SYSTEM 42
  1020000 
Example 7: What is the units digit of  100 ?
 10 + 3 
Solution: Let n = 10100. Then
2 2 100 100
1020000 n200 (n ) –(3 ) 9100
= +
10100 + 3 n+ 3 n+ 3 n+ 3

(n2 –32 )M 9100 9100

= + =(n–3)M+ .
n+ 3 n+ 3 n+ 3
Since 9100 < n, we have
 n200  n200 –9100 1020000 –8150
  =(n–3)M= = .
 n+ 3  n+ 3 10100 + 3
Since the units digit of 1020000 - 8150 is 9 and the units digit of 10100 + 3 is 3, the units digit of
the quotient must be 3.

Example 8: For any real number x, let [x] denote the largest integer less than or equal to x. Find the
value of [x] of the smallest x satisfying [x2] - [x]2 = 100.
Solution: Write x = [x] + {x}. Then 100  ([x] + {x})2 - [x]2 = 2[x] {x} + {x)2 < 2[x] + 1.
So [x]  50 and x2  [x2] = 100 + 502 = 2600. On the other hand, x = 2600
is a solution.

1000
Example 9: Find the sum of the digits of the value of  [log
k=3
2
k] .

(where [·] denotes greatest integer function)

Solution: Note that 2k+ 1- 2k = 2k, and that 2k  t < 2k+ 1 if and only if [log2 t] = k.
Then the requires sum (denoted by S) can be obtained by
9 1023
S=  k+1
 [log 2
t]+[log 2 3]– 
t = 1001
[log 2 t]
k = 2k  t < 2

 9  1023
=   k2k  + 1–  9 = 8192 + 1- 23(9) = 7986
k=2 
  t = 1001

Example 10: The solutions to the equation x3- 4 [x] = 5, where xis a real number, are denoted by x1, x2, x3
k
... xk for some k positive integer k. Find X
i= 1
3
1

(where [·] denotes greatest integer function)

Solution: Note that x- 1 < [x]  x. Note that if x  3, there will be no solution as
x3 - 4[x]  x3 - 4x = x (x2- 4)  3(5) = 15.
Also, if x  - 2, there will be no solution as x3- 4[x] < x3- 4(x- 1) = x (x2-4) + 4  4.
Hence the solution must be in the interval (- 2, 3).
If [x] =- 2, then x3 =- 3, giving x = 3 –3 , which is a solution.
If [x] = -1, then x3 = 1, giving x = 1 which contradicts with [x] = -1.
If [x] = 0, then x3 = 5, hence there is no solution.
If [x] = 1, then x3 = 9. Since 2 < 3 9 < 3 there is no solution.

If [x] = 2, then x3 = 13. Since 2 < 3 13 <3, x=3 13 is a solution.

Thus, the required answer is- 3 + 13 = 10.

NUMBER SYSTEM 43
Example 11: Evaluate the following sum
 1  1   2   1   2   3   1   2   4   1 
  +   +   +   +   +   +   +   +   +   + ....,
 1  2   2   3   3   3   4   4   4   5 
up to the 2013th term.
(where [·] denotes greatest integer function)
r  k 
Solution: We first note that for 1  r < k1   = 0 and   = 1. The total number of
k  k 
N  1
terms up to   is given by N (N + 1), and we have the inequality
N  2

62(63) 63(64)
= 1953< 2016=
2 2
 60 
So the 2013th term is   , and the sum up to this term is just 62.
 63 

Example 12: Set {x} = x- [x], where [x] denotes the largest integer less than or equal to x. If the number
of real solutions to the equation {x} + {x2} = 1, I x I  10 is k, then find the sum of digits of k.
Solution: Since {x} + {x2} = 1, x + x2 = n for some integer n. Then
–1± 1+4n
x=
2
1± 1+ 4n – 1+ 1+ 4n
 10 gives 0  n  110;  - 10 imphes 0  n  90.
2 2
If {x} + {x2}  1, then {x} + {x2} = 0 , which happens only if xis an integer
between- 10 to 10. So the total number of solutions to {x} + {x2} = 1 is 111 + 91- 21 = 181.

NUMBER SYSTEM 44
 EXERCISE - 2.7

1. If n is a positive integer, prove that  n + n + 1  =  4n + 2  .

   

2. Solve equation [x3] + [x2] + [x] = {x} - 1.

1
3. Solve equation [3x + 1] = 2x – and find the sum of all roots.
2

 10n 
4. Find the minimum natural number n, such that the equation   = 1989 has integer solution x.
 x 

5. How many of the first 1000 positive integers can be expressed in the form [2x] + [4x] + [6x] + [8x],
where x is a real number, and [z] denotes the greatest integer less than or equal to z?

6. How many different non-negative integers are there in the sequence

 12   22   32   19802 
 , ,  ,.....,  
 1980   1980   1980   1980 

7. For every positive integer n, show that  n + n+ 1  =  4n+ 1  =  4n+ 2  =  4n+ 3 

       

8. Solve the equation [x] {x} + x = 2{x} + 10.

 1093 
9. Find the last two digits of the number   (Write down the tens digit first, then write down
 1031 + 3 
the units digit).

92 92
10. Solve the equation x + =[x]+ .
x [x]

 11   12   99 
11. If x is a real number that satisfies x +  + x +  + ...... + x +  = 765 find the value of [900] –
 100   100   100 
[100x]. Here [a] denotes the largest integer  a.

12. Find the number of consecutive O's at the end of the base 10 representation of 206!.

n  n  n 
13. There are P number of positive integer n less than 2007 such that   +   +   = n where [x] is
2 3 6
the greatest integer less than or equal to x. Write the last two digit of P. (For example, [2.5] = 2; [5]
= 5; [-2.5] = -3 etc).

14. Let [x] denote the greatest integer less than or equal to x. Some P real values of x satisfy the
equation x2 + 10,000 [x] = 10,000x. What is P- 100?

15. For any real number x, let [x] denote the smallest integer that is greater than or equal to x and [x]
denote the largest integer that is less than or equal to x (for example, p.23l = 2 and L 1.23 J = 1).
Find the value of
2010 
2010  2010  
2010–   – 
k=1  k  k 
NUMBER SYSTEM 45
 ANWER KEY
EXERCISE – 2.1

Que. 1 2 3 4 5 6 7 8 9 10 11 12
Ans. 3 3 4 1 1 1 3 3 1 3 1 2

13. 01 14. 95 15. 07

EXERCISE – 2.2

Que. 1 2 3 4 5 6 7 8 9 10 11 12 13
Ans. 4 2 3 3 4 3 2 1 3 1 3 2 3

14. 00 15. 13

EXERCISE – 2.3

Que. 1 2 3 4 5 6 7 8 9 10 11 12
Ans. 3 1 4 3 1 4 2 3 2 1 3 2

13. 05 14. 40 15. 11

EXERCISE – 2.4

x2 − 9
1. 3+ 2 2. 3. 104 4. a>b 5. c<b<a
x+3
6. (C), x = 2, 3, 4, 5 7. –1 8. W<V<U 9. 3
2 + 1 10. 1

 4 if 1  a  5
11. 5− 2 12.   13. 4 a(a − 1)
2 a − 1 if a  5 

14.
2 ( a2 + a + 1 + a2 − a + 1 ) 15. a2
2

EXAMPLE – 2.6

1. (4) 2. 421 3. 1972 7. p = 3 (unique solution) 11. 03 12. 20

13. 17 14. 09 15. 49

EXAMPLE – 2.7
1 1 2 4
2. –1 3. –2 4. 7 5. 600 6. 1486 8. 10, 7 ,9 ,8 ,6
2 8 7 5

9. 08 10. –9.2 11. 47 12. 50 13. 34 14. 99 15. 16

NUMBER SYSTEM 46