UNIT 4

CHAPTER 2
NUMBER SYSTEM
BASIC CONCEPT BUILDER

Classification of the numbers:

The concept of numbers is made clear from the number tree. The basics of number tree is given
below.

 Number Tree –

Essential definitions are given below

Real Number: - The real numbers include all of the measuring [Link] the numbers on a number
line starting from -∞ to +∞ are real numbers.

Imaginary Number: - Number with square root of negative number is called imaginary number. These
numbers are in the form of a + ib.

Rational Number: - A rational number is a number that can be expressed as a fraction(p/q) with an
integer numerator and a non-zero natural number denominator. A number repeated after a decimal is a
recurring number. All recurring numbers are rational numbers.

Conversion of Recurring number to p/q form -

Find the number 1.45454545……….in the form of p/q.
Let x=1.454545…..

347
 100x=145.454545….
100x-x = 145.454545….-1.454545….
99x = 144
X = 145/99

Irrational Number: - In mathematics, an irrational number is any real number which cannot be
expressed as a fraction m/n, where m and n are integers, with n non-zero and is therefore not a rational
number.

Integers: - The integers are formed by the natural numbers including 0 (0, 1, 2, 3, ...) together with the
negatives of the non-zero natural numbers (−1, −2, −3, ...). Viewed as subset of the real numbers, they are
numbers that can be written without a fractional or decimal component, and fall within the set {... −2, −1,
0, 1, 2 ...}.

Fractions: - A fraction is a number that can represent part of a whole.

Proper Fraction: Value of the fraction is less than 1. These are in the form of ½, 2/3 , ¾ ..

Improper Fraction: - Value of the fraction is greater than 1. These are in the form of 3/2 , 4/3 …

Mixed Fraction: - When an integer is given before proper fraction then number is called mixed fraction.
Numbers of the form 2¾.

Whole Number: All non negative numbers including Zero. W ~ (0,1,2,3,4...)

Natural Numbers: - All the number starting from 1. N ~ (1,2,3,4...)

Natural Numbers = Whole Number - Zero

Prime and Composite Numbers - A number which has two factors 1 and itself is a prime number. 2 is
the only even prime number and that prime numbers greater than 3 are of the form 6k±1,or 4k±1 where k
is a natural number.. Here the converse is not true.i.e. all those numbers in the above mentioned form are
not necessarily the prime number.

Co-Prime Numbers (Relatively Prime Numbers):-

Pair of numbers that do not have any common factor except 1 are known as Co-prime numbers.

Remember:-
1. One is co-prime with any other number. (1,2) , (1,3) …
2. Two Consecutive numbers are always co-prime.
3. A prime number is co-prime with all numbers except its multiple.
4. Two prime numbers are always co-prime.

348
Divisibility rules:

Given below are some basic rules of divisibility of some common numbers
1. Number ending with 0,2,4,6,8 is divisible by 2
[Link] last two digit of a number is divisible 4 or the last 2 digits of a number having more than 2 digits, are
zeroes the number is divisible by 4
3 If last three digit of a number is divisible by 8 or the last 3 digits of a number having more than 3 digits,
are zeroes the number is divisible by 8.
Hence a general rule for numbers is that a number is divisible by 2n if the last n digits are divisible by 2n.

4. Same rule applies for [Link] a general rule for numbers is that a number is divisible by 5 n if the last n
digits are divisible by 5n.

6. If Sum of the digits of a number is divisible by 3/9 the number is divisible by 3/9.

7. For divisibility rule of 7 we make group of three digits starting from right towards left. Then we take
the sum of all the numbers of odd placed groups and even placed groups separately. Then we take the
difference of sum of odd placed groups and sum of even placed groups. if the difference is divisible by 7
the entire number is divisible by 7. Example: 346527659 if (346+659)-(527) is divisible by 7 the number
346527659 is divisible by 7. Divisibility rule of 7 and 13 is same.

8. For divisibility rule of 11 take the sum of all odd placed digits and sum of all the even placed digits
separately. Then take their difference. If the difference is divisible by 11 the entire number is divisible by
11. Example: for number 36542783748 if( (3+5+2+8+7+8) –( 6+4+7+3+4) ) is divisible by 11 the above
number is divisible by 11.

349
HCF & LCM

Factors and Multiples:

If number a divided another number b exactly, we say that a is a factor of b. In this case, b is
called a multiple of a.

Highest Common Factor (H.C.F.) or Greatest Common Measure (G.C.M.) or Greatest Common
Divisor (G.C.D.):

The H.C.F. of two or more than two numbers is the greatest number that divides each of them
[Link] are two methods of finding the H.C.F. of a given set of numbers:

o Factorization Method: Express the each one of the given numbers as the product of
prime factors. The product of least powers of common prime factors gives H.C.F.
o Division Method: Suppose we have to find the H.C.F. of two given numbers, divide the
larger by the smaller one. Now, divide the divisor by the remainder. Repeat the process of
dividing the preceding number by the remainder last obtained till zero is obtained as
remainder. The last divisor is required H.C.F.

Finding the H.C.F. of more than two numbers: Suppose we have to find the H.C.F. of three
numbers, then, H.C.F. of [(H.C.F. of any two) and (the third number)] gives the H.C.F. of three
given number.

Similarly, the H.C.F. of more than three numbers may be obtained.

Least Common Multiple (L.C.M.):

The least number which is exactly divisible by each one of the given numbers is called their
L.C.M.

There are two methods of finding the L.C.M. of a given set of numbers:

o Factorization Method: Resolve each one of the given numbers into a product of prime
factors. Then, L.C.M. is the product of highest powers of all the factors.

Example: Find the H.C.F. and LCM of 72, 126 and 270.

Solution:.Using Prime factorisation

72 = 2 x 2 x 2 x 3 x 3 = 23 x 32
126 = 2 x 3 x 3 x 7 = 21 x 32 x 71
270 = 2 x 3 x 3 x 3 x 5 =21 x 33 x 51

H.C.F. of the given numbers = the product of common factors with least index= 21 x 32
L.C. M of the given numbers = the product of common factors with highest index and

350
 the non-common terms = 23 x 33 x 51 × 71

o Division Method (short-cut): Arrange the given numbers in a row in any order. Divide
by a number which divided exactly at least two of the given numbers and carry forward
the numbers which are not divisible. Repeat the above process till no two of the numbers
are divisible by the same number except 1. The product of the divisors and the undivided
numbers is the required L.C.M. of the given numbers.

Some General rules for LCM/HCF

 H.C.F. and L.C.M. of Fractions:

H.C.F. of Numerators
1. H.C.F. =
L.C.M. of Denominators
L.C.M. of Numerators
2. L.C.M. =
H.C.F. of Denominators

 H.C.F. and L.C.M. of Decimal Fractions:

In a given numbers, make the same number of decimal places by annexing zeros in some
numbers, if necessary. Considering these numbers without decimal point, find H.C.F. or L.C.M.
as the case may be. Now, in the result, mark off as many decimal places as are there in each of the
given numbers.

 Comparison of Fractions:

Find the L.C.M. of the denominators of the given fractions. Convert each of the fractions into an
equivalent fraction with L.C.M as the denominator, by multiplying both the numerator and
denominator by the same number. The resultant fraction with the greatest numerator is the
greatest.

351
Applications of HCF & LCM

Example: Six bells commence tolling together and toll at intervals of 2, 4, 6, 8 10 and 12 seconds
respectively. In 30 minutes, how many times do they toll together ?

Solution:-
L.C.M. of 2, 4, 6, 8, 10, 12 is 120.

So, the bells will toll together after every 120 seconds (2 minutes).
In 30 minutes, they will toll together 30/2 + 1 = 16 times. One is added as for first time at t = 0 they
tolled together.

Example:
Six racers take 2, 4, 6, 8 10 and 12 seconds respectively to run a circular field. In 30 minutes, how many
times will they meet together at the point from which they started ?

The Logic is same. They will meet 16 times if we take this fact that at t=0, they started together.

Some important Facts:

1. If a, b and c give remainders p, q and r respectively, when divided by the same number H, then H
is HCF of (a-p), (b-q), (c-r).

2. If the HCF of two numbers ‘a’ and ‘b’ is H, then, the numbers (a+b) and (a-b) are also divisible
by H.

3. If a number N always leaves a remainder R when divided by the numbers a, b and c, then N =
LCM (or a multiple of LCM) of a, b and c + R.

4. If a Number when divided by a,b,c leaves a remainders of x,y,z respectively and a-x= b-y= c-z=
P, then the smallest number satisfying this condition is L.C.M(a,b,c)- P.

Example: Which is the smallest numbers which leaves a common remainder of 4 when divided by 6, 7,
and 9?
Solution: Here you should remember that the smallest number is [Link] next such number will be (LCM
of 6,7,9) + 4 i.e. 126+4 or 130

352
 REMAINDERS:
A number M when divided by N leaves remainder R , and quotient is Q can be represented by
M=NQ + R. where M is dividend, N is divisor,Q is quotient and R is remainder. The above rule is
what is commonly called as the Division algorithm.
The concepts required to solve the questions of remainders are enumerated below
 Reducing remainders
 Negative remainders
 Fermat’s little theorem
 Chinese remainders
 Wilson’s rule.

Reducing remainders

Some basic rules are given below:

Remainders (axb)/c= remainder(a/c) x remainder(b/c)

Remainder (a+b)/c= remainder (a/c) + remainder (b/c)
Remainder (a-b)/c=remainder (a/c) –remainder (b/c)

Examples:
a)(142+143+145)/7. what is the remainder.?
(2 + 3+ 5)/7 =remainder is 5
b) (142x143x145)/7 What is the remainder .?
(2 x 3 x 5)/7 =2
c) (142x142x142x-------------------100 times) /[Link] is the remainder?
= (2x2x2x………………..100 times)/7.
= (8x8x8……33 times x2)/7
= 2.
Keep on dividing the remainders till the final remainder is less than divisor.

Concept of negative remainder:

Remainder 27/7 =6 or its conjugate -1
Remainder 26/7 =5 or its conjugate -2
What is the remainder 1597/8?
= (15x15x15x……………97 times)/8
= (-1x-1x-1x………………… 97 times)/8
= -1 or its conjugate7

Fermat’s little theorem:

Remainder ( MN-1 )/N =1
Where M and N are coprime and N is a prime number.
Example: (2100)/101 =1, (396)/97 = 1.
Find the remainder when (51000) is divided by 77?
=(51000) /(7x11)
353
 using fermat’s rule 56 /7 = remainder is 1 so 530/7 (remainder ) =1
using fermat’s rule 510/11= remainder 1 so 530/11 (remainder ) =1
530/77 remainder =1
((530)33 x 510 ) /77 = remainder 23 . where( 510/77) remainder is 23 has to be dealt separately by
reducing remainders theory.

Chinese remainders:
Remainder N/(axb) =apr1+bqr2: where remainder of N/a = r2 and N/b = r1 and ap+ bq =1.
=(51000) /(7x11)
= remainder (51000)/7 = ((56)166x 54 ) /7 = 2 (using fermat’s rule 56 /7 = mainder is 1.)
= remainder (51000)/ 11 =(510)100 /11 =1 (using fermat’s rule 510/11=remainder 1
7p+11q=1 for p= -3,q= 2
So the final remainder is = 7x-3x1 + 11x2x2 =23.

Wilson’s rule:
Remainder ( (N-1)!+1) when divided by N has a remainder of 0
Example: (4! + 1) / 5 = remainder is 0, (6! + 1) /7 =remainder is 0.
Find the remainder for (96!+1000)/97 :
(96!+1) is divisible by 97
So final remainder is remainder 999/97 =29.

Important result:
Theorem: an + bn is divisible by a + b when n is ODD.
Theorem 2: an – bn is divisible by a + b when n is EVEN.
Theorem 3: an – bn is ALWAYS divisible by a – b.

354
Cyclicity :

Important Concepts and Shortcuts of Cyclicity of Numbers

Types of questions based on cyclicity of numbers - There are mainly 3 categories of questions which
fall under cyclicity of numbers, which include

1. How to find units digit of ab

2. How to find units digit of ab * cd * ef
3. How to find units digit of abc

Find units digit of ab - Given ab, units place digit of the result depends on units place digit of a and the
divisibility of power b. Consider powers of 2
As we know,
21 =2
22 = 4
23 = 8
24 = 16
25 = 32
26 = 64
27 = 128.. and so on
What do you observe here? We can see that the units place digit for powers of 2 repeat in an order: 2, 4, 8,
6. So the "cyclicity" of number 2 is 4 (that means the pattern repeats after 4 occurrences) and the cycle
pattern is 2, 4, 8, 6. From this you can see that to find the units place digit of powers of 2, you have to
divide the exponent by 4.

Example: Find the units place digit of 299?

Using the above observation of cyclicity of powers of 2, divide the exponent by 4. 99/4 gives reminder as
3. That means, units place digit of 299 is the 3rd item in the cycle which is 8.

Shortcuts to solve problems related to units place digit of ab

 Case 1: If b is a multiple of 4
o If a is an even number, ie: 2, 4, 6 or 8 then the units place digit is 6
o If a is an odd number, ie: 1, 3, 7 or 9 then the units place digit is 1
 Case 2: If b is not a multiple of 4
o Let r be the reminder when b is divided by 4, then units place of ab will be equal to units
place of ar

355
  Here we have captured the cyclicity of numbers upto 9 in the below table.

Number ^1 ^2 ^3 ^4 Cyclicity

2 2 4 8 6 4

3 3 9 7 1 4

4 4 6 4 6 2

5 5 5 5 5 1

6 6 6 6 6 1

7 7 9 3 1 4

8 8 4 2 6 4

9 9 1 9 1 2

Here ^1 means power raised to 1.

Find units digit for numbers of the form ab * cd

1. First find the unit digit of ab and cd separately. Let the answers be x and y
2. Then unit digit of ab * cd = units digit of x * y

Find units digit of abc

 Case 1: If cyclicity of units place digit of a is 4 then we have to divide the exponent of a by 4 and
find out the remainder. Depending on the value of remainder we can apply the general rule of
cyclicity given above and reach the solution.
 Case 2: If cyclicity of units place digit of a is 2, only extra information we need to find is if the
exponent will be even or odd. Then we can apply the general rule of cyclicity given above and reach
the solution.

Example - Find the units place digit of 24344

Here cyclicity of units place digit is 4 (Units place digit is 2, from the above table we can see the cyclicity
of 2 is 4). Hence case 1 is applicable. Now we have to find the remainder when exponent of 2 is divided
by 4, which is the remainder when 4344 is divided by 4. Remainder of 4344/4 = Remainder of (44 –
1)44/4 Using the binomial theorem, (as explained in number system tutorial) we can see that there is only
one term in the expansion of (44 – 1)44 which is not divisible by 4. The term is 144/4 Remainder of 144/4
= 1 Now we can apply the general rules of cyclicity, (since reminder is 1, case 2 of general rule of
cyclicity is applicable) which says, units place of 24344 = units place of 21 = 2

356
Surds

 Surds are numbers left in root form (√) to express its exact value. It has an infinite number of
non-recurring decimals. Therefore, surds are irrational numbers.
 There are certain rules that we follow to simplify an expression involving surds. Rationalizing
the denominator is one way to simplify these expressions. It is done by eliminating the surd in
the denominator. This is shown in Rules 3, 5 and 6.
 It can often be necessary to find the largest perfect square factor in order to simplify surds. The
largest perfect square factor is found by looking at any possible factors of the number that is
being square rooted. Let’s say that you are looking at the square root of 242. Can you simplify
this? Well, 2 x 121 is 242 and we can take the square root of 121 without leaving a surd (because
we get 11). Since we cannot take the square root of a larger number that can be multiplied by
another to give 242 then we say that 121 is the largest perfect square factor.

Six Rules of Surds

Rule 1:
Simplify :
Since , as 9 is the largest perfect square factor of 18.

Rule 2:

Simplify :

Rule 3:

By multiplying both the numerator and denominator by the denominator you can rationalize the
denominator.
357
rationalize :

Rule 4:
Simplify :

Rule 5:

Following this rule enables you to rationalize the denominator.

Rationalize :

Rule 6:

Following this rule enables you to rationalize the denominator.

Rationalize :

358
Indices

1) Multiplication of Powers with the Same Base - When numbers with the same base are multiplied, the
power of the product is equal to the sum of the powers of the numbers. If 'a' is a non-zero integer, and 'm'
and 'n' are whole numbers then, am × an = am+n.
2) Division of Powers with the Same Base - When numbers with the same base are divided, then the
power of the quotient is equal to the difference between the powers of the dividend and the divisor. If 'a' is
a non-zero integer, and 'm' and 'n' are whole numbers then, am ÷ an = am-n.

3) Power of a Power - If 'a' is any non-zero integer, and ‘m’ and ‘n’ are whole numbers then, (am)n = amn.

4) Multiplication of Powers with the Same Exponent - If 'a' is any non-zero integer, and ‘m’ is a whole
number then, am × bm = (ab)m.

5) Division of Powers with the Same Exponent - If a and b are any non-zero integers and m is a whole
number then, am ÷ bm = ( a /b)m

6) Numbers with an exponent of zero - For any non-zero integer a, a0 = 1.

359
Base System
We represent our base 10 numbers, such as 201 in the following
way:
So that each digit is in 0..9, and its position determines which power of 10 we need to multiply it by. Two
important symbols in our decimal system are 0, which has been used extensively only in the last few
hundred years in Europe, and ".", the decimal point which marks the whole numbers from the fractions
(something which was absent in the Babylonian system, and which causes some confusion.. when, for
instance, we cannot distinguish 0.25 and 25!)

In general, we represent the whole numbers in our base 10 system in the following way:

Where a is a number, such as 201, and the a's with subscripts are numbers between 0 and 9.

Generalising even further, we can represent numbers in the base, b, as follows:

If we divide a number a, by b continuously, we find that the remainders of division are the digits of our
new number base b.

When converting from one base to another (excluding base 10) we need to do arithmetic in a base other
than ten. For this reason it is better to convert from one base to another through the intermediary of base
10; that is, we convert one number in base b1 into base 10 and then from base 10, we convert the number
to b2.

Converting Whole Numbers in Base 10 to Another Base

We can convert a number in base 10 to another base system by repeatedly dividing the number by b, the
new base.
For instance, we wish to convert 10 in base 10, to a number in base 3

Convert 10, base 10 to base 3

Number of fd3's Remainder

10= 3•3+ 1

3= 3•1+ 0

360
 1= 3•0+ 1

We read off the new number, base 3 from the remainders: [1,0,1], or 1013. So 10 in base 10 is 101 in base
3.

Remark, we could have noticed that because the 1 in the last but one line is less than 3, we could have
read the number off beginning with this obvious next remainder, and the other remainders: 101, base 3.

As a second example, we can convert 102 in Base 10 to Base 16 (or hexadecimal).

Convert 102, base 10 to base 16

Number of 3's Remainder

102= 16•6+ 4

6= 16•0+ 6

Reading off the remainders, we note that 10210=6416

In numbers having bases more than 10, the remainders will be denoted in alpha numeric form

Converting a Number in Base b to a Decimal Number

A number, such as 101 in base 2 can be thought of as 12011, where the superscripts are reminders that in
the position to the right of the index, the number in base 10 is that number times that power of two. That
is:
12011 =1•4+0•2+1=6.

And for 64 in base 16:

6140=6•16+4•160=100, base 10
And 101, base 3 gives:
120110=1•32+0•31+1•30=10, base 10

361
FACTORIAL

Factorial is an important topic in quantitative aptitude preparation. The factorial of a non negative integer
n is denoted as n! The notation was introduced by Christian Kramp in 1808.n! is calculated as the product
of all positive integers less than or equal to n.

i.e 6! = 1 * 2 * 3 * 4 * 5 * 6 = 720

n! = 1 when n = 0, and n! = (n-1)! * n if n > 0

n! is the number of ways we can arrange n distinct objects into a sequence.

2! = 2 means numbers 1, 2 can be arranged in 2 sequences (1, 2) and (2, 1).

We can arrange 0 in one way. So 0! = 1, not zero. Now we know why, and no need to say “its like that” if
someone asks ;-)

Find the highest power of a prime number in a given factorial

The highest power of prime number p in n! = [n/p1] + [n/p2] + [n/p3] + [n/p4] + ….. where [n/p1] denotes
the quotient when n is divided by p

Solved Example:
The maximum power of 5 in 60!
Sol: 60! = 1 x 2 x 3 ..................60 so every fifth number is a multiple of 5. So there must be 60/5 = 12
In addition to this 25 and 50 contribute another two 5's. so total number is 12 + 2 = 14
Short cut: [60/5]+[60/52]=12+2=14
Here [ ] Indicates greatest integer function.
Solved Example:
How many zero's are there at the end of 100!
Sol: A zero can be formed by the multiplication of 5 and 2. Since 100! contains more 2's than 5's, we can
find the maximum power of 5 contained in 100!

For your understanding:

⇒100/2+100/4+100/8+100/16+100/32+100/64 = 50 + 25 + 12 + 6 + 3 + 1 = 97
⇒100/5+100/25=20+4=24

362