Beruflich Dokumente
Kultur Dokumente
Number system
1. Properties of numbers
2. Theorems of numbers
3. Divisibility rules
4. Digital root concept
5. Cyclicity of powers and finding unit digit of given mathematical
expression
6. Highest power of prime contained in factorials
7. Finding remainders:
Methods:
1. Remainder theorem
2. Binomial theorem
3. Euler’s function
4. Wilson theorem
5. Others
6. Miscellaneous questions based on number theory concepts
Properties of Numbers:
1. Every square number is of one of the forms 5n, 5n ± 1.
2. The square of every odd number is of the form 8n + 1.
3. Sum of n consecutive numbers is always divisible by n if n is odd and sum
of n consecutive numbers is never divisible by n if n is even.
3. P is the product of all prime numbers from 1 to 100. Then the number of
zeros at the end of the product is
4. ‘x’ is a prime number greater than 100. What will be the remainder if x2,
is divided by 12.
10. ABC is a three-digit number such that ABC = 5(AB + BC + CA), where AB,
BC and CA are all two digit numbers. Find the total number of possible
values for the number ABC.
A. 13 B. 12 C. 3 D. 4
11. If x and y are positive integers less than 8, how many distinct values can
the expression (3x + 7y) take ?
A. 49 B. 48 C. 21 D. 36
Divisibility Test
(1) A number will be divisible by 2 iff the digit at the unit place is divisible by
2.
(2) A number will be divisible by 3 iff the sum of digits of the number is
divisible by 3
(3) A number will be divisible by 4 iff last two digits of the number together
are divisible by 4.
(4) A number will be divisible by 5 iff digit at the unit place is either 0 or 5.
(5) A number will be divisible by 6 iff the digit at the unit place of the
number is divisible by 2 & sum of all digits of the number is divisible by
3.
(6) Divisibility test of 7: Make two set of three nos. starts from unit digit
then add the alternate sets, and find out the mutual difference, if it is 0
or any multiple of 7 then the given no. is divisible by 7.
e.g., 001234567
567 + 001 – 234 = 334
Since 334 is not divisible by 7 the given no. is also not divisible by 7.
The same test is applicable for 11 &13. In these cases we have to see the
result is divisible by 11 or 13 respectively or not.
(7) A number will be divisible by 8 iff the last 3 digits, all together, is divisible
by 8.
(8) A number will be divisible by 9 iff sum of all it’s digits is divisible by 9.
(9) A number will be divisible by 10 iffit’s last digit is 0.
(10) A number will be divisible by 11, iff the difference between the sum of
the digits at even places and sum of the digits at odd places is a multiple
of 11.
e.g., 1298, 1221, 123321, 12344321, 1234554321, 123456654321,
795432
(11) Divisibility By 12: A number is divisible by 12, if it is divisible by both 4
and 3.
(12) Divisibility By 14:A number is divisible by 14, if it is divisible by 2 as well
as 7.
(13) Divisibility By 15: A number is divisible by 15, if it is divisible by both 3
and 5.
Practice questions:
1. X = 1234…….616263. What will be the remainder if x is divided by 8 and
9 and 72?
2. In above question if you add all digits till you get a single digit, what that
digit will be?
10. If when 950 and 1170 are divided by a natural number d, the remainders
obtained are 18 and 5 respectively, then d is a t most
(A) 117 (B) 247 (C) 223 (D) 123
11. pq, qr, qp and pp are two-digit numers, 'pqr' is a three-digit number and
'prrp' is a four-digit number (p, q, r are all numerals.) If pq x pr = pqr,
then the remainder when (qp x prrp) is divided by 'pp' is
(A) 0 (B) 1
(C) 7 (D) None of these
12. Given that a, b, c and d are positive integers such that b3/2 = a, and d5/4 =
c. If b – d = 9. then find the value of (a – c).
(A) 92 (B) 94 (C) 95 (D) 93
13. For how many values of n less than 17, n being a positive integer, is n! +
(n + 1)! (n + 2)! an integral multiple of 49 ?
14. (A) 5 (B) 2 (C) 3 (D) 1
Cyclicity of power
15. Find the unit’s digit of the expression 111 + 122 + 133 + 144 + 155 + 166.
1. 1 2. 9 3. 7 4. 0
16. Find the unit’s digit of the expression 111 × 122 × 133 × 144 × 155 × 166?
1. 1 2. 9 3. 7 4. 0
17. Find the unit’s digit of the expression : 55725 + 735810 + 22853.
1. 4 2. 0 3. 2 4. 6
19. In the number 1604320, after how many digits from the right will you
encounter the first odd digit ?
1. 4320 2. 4321 3. 4322 4. 4323
Highest power of prime contained in factorials
3. What is the highest power of 44, which will divide P without any
remainder? Given the value of
P is 44! x 45?
1. 4 2. 20 3. 16 4. 1
Theorems on Division:
(1) If both ‘a’ and ‘b’ are divisible by ‘c’, so also is ma ± nb.
(2) If ‘r’ is the remainder when ‘a’ is divided by ‘b’, then ‘cr’ is the remainder
when ‘ca’ is divided by ‘cb’.
(3) The product of any ‘n’ consecutive integers is divisible by n .
(4) Dividend = quotient x divisor + remainder
Fermat’s Theorem:
If p is a prime and a is any number prime to p, then ap1 1 is divisible by
p.
Corollary 1:
If p is a prime and a is any number whatever, then ap a is divisible by p.
For ap a a(ap1 1), and if a is prime to p, ap1 1 is divisible by p,
The fifth power of any number N has the same right-hand digit as N.
Wilson’s Theorem:
If p is a prime number, then p 1 1 is divisible by p.
Lagrange’s Theorem:
If p is a prime and r is any number less than p – 1, the sum of the
products of the numbers 1, 2, 3, …., p – 1 taken r together is divisible by
p.
Practice questions :
1. If N = 1421 × 1423 × 1425, what is the remainder when ‘N’ is divided by
12?
1. 0 2. 1 3. 3 4. 9
11. Find the last two digits of the product : 122 × 123 × 125 × 127 × 129.
1. 20 2. 50 3. 30 4. 40
3. Find the remainder when (3! + 6! + 12! + 24! + 48! + 96!) is divided by
66.
1) 0 2) 1 3) 33 4) 65