Number System

Formula Sheet

Number System

Complete Formula Sheet

USEFUL for SSC CGL, CHSL, CPO & MTS
 Number System
Formula Sheet
13.1 INTRODUCTION • Divisibility by 2 - Number will be
divisible by 2 if last digit be is divisible by
This chapter is most important chapter of 2.
quantitative aptitude for SSC Exams. The
weightage of this chapter in Tier 1 is about • Divisibility by 4 – Number will be
2questions and in Tier 2, around 4- divisible by 4 if last 2 digit is divisible by
5questions. You are advised to go through 4.
• Divisibility by 8 - Number will be
each and every concept, example and
question of this chapter. Number system is divisible by 8 if last 3 digits is divisible by
8.
the key concept in every branch of
• Divisibility by 16 – Number will be
mathematics. The use and scope of number
divisible by 16 if last 4 digits is divisible by
system is unlimited. This will also help in
16.
calculations and elimination of options in the
Note – A number will be perfect square
exam. if its last digit has (0, 1, 4, 5, 6, 9)
13.2 IMPORTANT CONCEPTS
• Divisibility by 3 - Number will be
1. UNIT DIGIT divisible by 3 if sum of digits of number
• Cyclicity = 1 is divisible by 3.
{0, 1, 5, 6}
• Divisibility by 9 - Number will be
• Cyclicity = 2 divisible by 9 if sum of digits of number
4odd = 4 9odd = 9 is divisible by 9.
4even = 6 9even = 1
{4, 9} • Divisibility by 11 –

• Cyclicity = 4
{2, 3, 7, 8}
1 + 2 + 1 + 1 = 5 ⇒ This sum must be 0, 11
Ø Step 1 – Divide the number by 4 and find or multiple of 11, so 98754321 Not
out the remainder (R) divisible by 11.

R
Ø Step 2 - {2, 3, 7, 8} ® unit digit. • Divisibility by 7,11,13- If a number is
divisibly by 7,11,13, then it will be
Eg. 241 ´ 742 ´ 843 . Find unit digit divisible by 1001. The number will be in
Sol. 2 ´ 742 ´ 843 form XYZXYZ
Cyclicity = 4 divide power by 4 find R. Eg. If a number 238abc is divisible by
Unit digit ® 21 ´ 72 ´ 83 ® 2 × 9 × 2 ® 6 7,11,13, then find a+b+c?
Eg. Find unit digit of 1! + 2! + 3! + Sol. since it is divisible by 7,11,13 then
………+100! a=2, b=3, c=8
Sol. 1! + 2! + 3! + 4! + 5! +…. +100! (from Therefore a+b+c= 2+3+8=13
5! to 100! Every term has 0 in the last)
1 + 2 + 6 + 24 ® 2 + 1 = 3 3. FACTORS
NOTE :
If any power gets divided by 4
completely,then take
R=4

2. DIVISIBILITY

• Number of factors- ap ´ bq ´ cr
 Number System
Formula Sheet
Number of factors = (p+1)(q+1)(r+1)
Eg. 2160 = 24 x 33 x 51 number of factors
Number of factors = 5 x 4 x 2 = 40 • Product of factors – N ( )
2
Sum of factor
• Number of even factors – of Average of factors =
No. of factors
2p bqcr = p ( q + 1)(r + 1)
Eg. 100 = 22 ´ 52
é 20 50 ù • Number of Prime factors - If ap bq cr
ê ú than No. of prime factors is p + q + r.
ê 21 51 ú
ê ú Eg. No. of prime factors of 213 315 516 ®
ê 22 52 ú 13 +15 + 16
ëê ûú
2 ´ 3 ® 6 No. of even factors. = 44

4. NUMBER OF ZEROES
• Number of odd factors – No. of zeros = No. of 5
2 b c = 2 ( q + 1)(r + 1)
p q r 0
én ù é n ù é n ù
= ê ú + ê ú + ê ú +…
⇒ (q + 1) (r + 1) ë 5 û ë 52 û ë 53 û
Eg. 100 = 22 ´ 52 Eg. Find No. of zeros in 100! ?
é 0 50 ù Sol –
odd ê 2 ú
even ê 21 ´ 51 ú
ê ú
even ê22 ´ 52 ú
ëê úû 20 + 4 = 24
1×3=3
No. of odd factors of 100 is 3. 5. REMAINDER THEOREM

• Sum of factors • Dividend = divisor × quotient +

( )(
apbqcr = a0 + a1 + …ap b0 + b1 + …bq c0 + c1 + ....cr )( ) remainder
Eg.
Eg. 100 = 22 ´ 52
20 ® 50
21 ® 51
22 ® 52

(50
)(
+ 51 + 52 20 + 21 + 22 )
17 = 5 × 3 + 2
• Sum of even factors NOTE :

( )(
2p bq cr = 21 + 22 + …2p b0 + b1 + …bq c0 + c1 + …cr )( )
Eg. 240 = 24 ´ 31 ´ 51
Sum of even factors Divisor = x = r1 + r2 - r3
( )(
= 21 + 22 + 23 + 24 30 + 31 50 + 51 )( ) Eg - When a certain number is
Þ 30 ´ 4 ´ 6 = 720 divided by a certain divisor leaves
remainder 43 and another number is
• Sum of odd factors – divided by same divisor leaves
remainder 37. If sum of both number is
(
2p bq cr Þ 20 b0 + b1 + …bq c0 + c1 + …cr )( ) divided by same divisor leaves
4
Eg. 240 = 2 ´ 3 ´ 5 1 1 remainder 13. Find divisor?

(2 )(3
0 0
)( )
+ 31 50 + 51 = 1´ 4 ´ 6 = 24.
Sol. Divisor = 43 + 37 – 13 = 67
 Number System
Formula Sheet
x • Least Common Multiple (LCM) - LCM of
® Rem. = R
D x, y, z is the smallest number which is
2x 2R exactly divisible by x, y, z.
® Rem. =
D D Eg. Multiple of 12 – 12, 24, 36, 48, 60, 72,
x 84, 96
® Rem. = R
D 16 – 16, 32, 48, 64, 80, 96
x2 R2 Common – 48, 96
® Rem. = Least – 48. ® LCM
D D
x R3
® Rem. = • Important type
D D
Q. Find the smallest number which is
exactly divisible by x, y, z?
• Concept of Remainder
Sol. LCM of x, y, z.
A +B +C +D A + BR + CR + DR
®R = R Q. Find the smallest number which is
M M
divided by x, y, z and leaves remainder r?
A ´B ´ C ´D A ´ B ´ C ´ DR
Ø ®R = R R R Sol. LCM of (x, y, z) + r
M M
Q. Find the smallest number k which is
Ø Concept Negative Remainder –
divided by x, y, z and leaves remainder a,
b, c respectively.
Sol. LCM of (x, y, z) – k, where
k=x–a=y–b=z–c
Ø Remainders of algebraic expressions
9. HIGHEST COMMON FACTOR (HCF)

( x + a)n ® R = an HCF of x, y, z is the largest number which

x can divide x, y, z exactly
Or Eg. Factors of 12 ® 1, 2, 3, 4, 5, 6, 12
Factor of 16 ® 1, 2, 4, 8, 16
( tx + a)x ® R = an éët - multiple of xùû Common ® 1, 2, 4
x
Highest ® 4 ® HCF
6. FERMAT THEOREM
NOTE:
aP -1
=R ®1 HCF can never be greater than the
P
difference of two numbers. HCF may be
P is a Prime number and a, p both are co- difference or factor of difference.
prime
2100
Eg. Find the remainder in ?
101
2100
Sol - ® R = 1. NOTE:
101
If two number are divided by their
difference or factor of difference then it
7. WILSON THEOREM
leaves same remainder.
• Important Type-
(P - 1)! = P - 1 remainder Q. Find the largest number which can
P
divide x, y, z exactly.
P is a prime no.
Sol. HCF of x, y, z
28!
Eg. Find the remainder in ? Q. Find the largest number which can
29
divided x, y, z and leaves remainder ‘r’ in
Sol – Remainder is 28.
each case.
Sol. HCF of x–r, y–r, z–r
8. LCM & HCF-
or
 Number System
Formula Sheet
st
HCF of x - y , y - z , z - x Ø Sum cubes of 1 n natural numbers
2
Q. Find the largest number which can é n (n + 1) ù
divided x, y, z and leaves remainder a, b, =ê ú
ëê 2 ûú
c.
Ø Sum of squares of 1st n even numbers
Sol. HCF of (x-a), (y-b), (z-c)
2n (n + 1)( 2n + 1)
=
3
10. Relation between HCF and LCM
• Geometric Progression (GP)
• Product of two number = Product of their
HCF and LCM
NOTE: Ø nth term = an = arn-1
If HCF of two number is H then number where a is the first term, r is the common
can be Hx and Hy where x and y are ratio, and n is the number of terms.
relatively prime numbers. Ø Sum of n terms of a geometric
progression
11. LCM and HCF of fraction
Sn =
(
a 1- rn ) when r ¹ 1
1- r
sn = na when r = 1
Where n = number of
a c e LCM of a,c, e terms, a = first term, and d = common
LCM of , , =
b d f HCF of b,d, f difference
a
Ø Sum of infinite GP = , where -1<r<1.
1- r
a c e HCF of a, c, e
HCF of , , =
b d f LCM of b,d, f

12. SEQUENCE AND SERIES

• Arithmetic Progression (AP)

AP series
® a, a + d, a + 2d, a + 3d………
Where a = 1st term, d = Common
difference
Ø nth term, an = a + (n – 1)d
Ø Sum of n terms,
n n
Sn = é2a + (n - 1) dù = éëa + lùû , where l is
2ë û 2
the last term.
NOTE:
n (n + 1)
Ø Sum of 1st ‘n’ natural numbers =
2
Ø Sum of 1st ’n’ odd numbers
é last term + 1ù
= n2 ® ê where Þ n = ú
ë 2 û
Ø Sum of 1st ‘n’ even numbers
é Last term ù
= n(n + 1) ® ên = ú
ë 2 û
Ø Sum of squares of 1st ‘n’ natural
n (n + 1)( 2n + 1)
numbers =
6