REAL NUMBERS

(iii) A rational number may be positive, negative

CONTENTS or zero.

 Number System  Complex numbers :

Complex numbers are imaginary numbers of the
 Euclid's Division Lemma or Euclid's form a + ib, where a and b are real numbers and
Division Algorithm i = – 1 , which is an imaginary number.

 The Fundamental Theorem of Arithmetic  Factors :

A number is a factor of another, if the former
 The Fundamental Theorem of Arithmetic exactly divides the latter without leaving a
remainder (remainder is zero) 3 and 5 are factors
to Find H.C.F. and L.C.M. of 12 and 25 respectively.
 Multiples :
NUMBER SYSTEM A multiple is a number which is exactly divisible
by another, 36 is a multiple of 2, 3, 4, 9 and 12.
 Natural Numbers :
 Even Numbers :
The simplest numbers are 1, 2, 3, 4....... the
Integers which are multiples of 2 are even number
numbers being used in counting. These are called
(i.e.) 2,4, 6, 8............... are even numbers.
natural numbers.
 Odd numbers :
 Whole numbers :
Integers which are not multiples of 2 are odd
The natural numbers along with the zero form the
numbers.
set of whole numbers i.e. numbers 0, 1, 2, 3, 4 are
whole numbers. W = {0, 1, 2, 3, 4....}  Prime and composite Numbers :
 Integers : All natural number which cannot be divided by
any number other than 1 and itself is called a
The natural numbers, their negatives and zero
prime number. By convention, 1 is not a prime
make up the integers.
number. 2, 3, 5, 7, 11, 13, 17 ............. are prime
Z = {....–4, –3, –2, –1, 0, 1, 2, 3, 4,....} numbers. Numbers which are not prime are called
composite numbers.
The set of integers contains positive numbers,
negative numbers and zero.  The Absolute Value (or modulus) of a real
Number :
 Rational Number :
If a is a real number, modulus a is written as |a| ;
(i) A rational number is a number which can be
|a| is always positive or zero.It means positive
p value of ‘a’ whether a is positive or negative
put in the form , where p and q are both
q
|3| = 3 and |0| = 0, Hence |a| = a ; if a = 0 or a > 0
integers and q  0.
(i.e.) a  0
(ii) A rational number is either a terminating or
|–3| = 3 = – (–3) . Hence |a| = – a when a < 0
non-terminating and recurring (repeating)
decimal. Hence, |a| = a, if a > 0 ; |a| = – a, if a < 0
 Irrational number :
(i) A number is irrational if and only if its 3 10 0.33……
decimal representation is non-terminating and 9
non-repeating. e.g. 2 , 3 , ................ etc. 10
9
(ii) Rational number and irrational number taken 1……
together form the set of real numbers.
1
(iii) If a and b are two real numbers, then either or = 0.142857142857…..
7
(i) a > b or (ii) a = b or (iii) a < b
(iv) Negative of an irrational number is an = 0.142857
irrational number. 7 10 0.14285….
(v) The sum of a rational number with an 7
irrational number is always irrational. 30
28
(vi) The product of a non-zero rational number 20
with an irrational number is always an 14
irrational number. 60
56
(vii) The sum of two irrational numbers is not
40
always an irrational number.
35
(viii) The product of two irrational numbers is not 50
always an irrational number. 49
1….
In division for all rationals of the form
p In both examples remainder is never becomes
(q  0), p & q are integers, two things can zero so the decimal expansion is never ends after
q
some or infinite steps of division. These type of
happen either the remainder becomes zero or
decimal expansions are called non terminating.
never becomes zero.
In above examples, after Ist step & 6 steps of
7
Type (1) : Eg : = 0.875 division (respectively) we get remainder equal to
8 dividend so decimal expansion is repeating
8 70 0.875 (recurring).
64 So these are called non terminating recurring
60 decimal expansions.
56
40 Both the above types (1 & 2) are rational
40 numbers.
×
Types (3) :
This decimal expansion 0.875 is called
Eg :The decimal expansion 0.327172398……is
terminating.
not ends any where, also there is no arrangement
If remainder is zero then decimal expansion of digits (not repeating) so these are called non
ends (terminates) after finite number of steps. terminating not recurring.
These decimal expansion of such numbers These numbers are called irrational numbers.
terminating.
Eg. :
Type (2) :
0.1279312793 rational terminating
1
Eg : = 0.333………. 0.1279312793…. rational non terminating
3
= 0. 3 or 0.12793 & recurring
0.32777 rational terminating

0.327 or rational non terminating

0.32777……. & recurring
 0.5361279 rational terminating 2 2.5 = 5
0.3712854043…. irrational non terminating Similarly, irrational number between 2 and
non recurring 5 is 2 5
0.10100100010000 rational terminating
So, required numbers are 5 and 2 5 .
0.10100100010000…. irrational non terminating
non recurring. Ex.3 Find two irrational numbers lying between
2 and 3 .
Real Numbers
Sol. We know that, if a and b are two distinct
positive irrational numbers, then ab is an
Rational no. Irrational no. irrational number lying between a and b.

If remainder = 0 If remainder  0 If remainder  0

 Irrational number between 2 and 3 is
& rem. = devidend & rem.  any devidend 2 3 = 6 =6 1/4

Terminating Non terminating Non terminating

& & non repeating Irrational number between 2 and 61/4 is
Non repeating repeating (recurring)
2  61/ 4 = 21/4 × 61/8.
18 1
Eg :  3.6 Eg :  0.33.... .. Eg : 0.671234….. Hence required irrational number are 61/4 and
5 3
21/4 × 61/8.
= 0. 3 Eg : 1.343634003908…...
Ex.4 Find two irrational numbers between 0.12 and
EXAMPLES  0.13.
Sol. Let a = 0.12 and b = 0.13. Clearly, a and b are
Ex.1 Insert a rational and an irrational number rational numbers such that a < b.
between 2 and 3.
We observe that the number a and b have a 1
Sol. If a and b are two positive rational numbers in the first place of decimal. But in the second
such that ab is not a perfect square of a place of decimal a has a 2 and b has 3. So, we
rational number, then ab is an irrational consider the numbers
number lying between a and b. Also, if a,b are c = 0.1201001000100001 ......
ab
rational numbers, then is a rational and, d = 0.12101001000100001.......
2
number between them. Clearly, c and d are irrational numbers such
that a < c < d < b.
  A rational number between 2 and 3 is
Theorem : Let p be a prime number. If p
23 divides a2, then p divides a, where a is a
= 2.5
2 positive integer.
An irrational number between 2 and 3 is Proof : Let the prime factorisation of a be as
follows :
2 3 = 6
a = p1p2…..pn, where p1,p2,…..pn are primes,
Ex.2 Find two irrational numbers between 2 and not necessarily distinct.
2.5.
Therefore,
Sol. If a and b are two distinct positive rational
numbers such that ab is not a perfect square a2 = (p1p2…..pn) (p1p2 ….. pn) = p12 p 22 ….. p 2n .
of a rational number, then ab is an Now, we are given that p divides a2.
irrational number lying between a and b. Therefore, from the Fundamental Theorem of
  Irrational number between 2 and 2.5 is Arithmetic, it follows that p is one of the
prime factors of a2. However, using the
 uniqueness part of the Fundamental Theorem (ii) Let us assume, to contrary, that 3 is
of Arithmetic, we realise that the only prime rational. That is, we can find integers a and b
factors of a2 are p1, p2,…, pn. So p is one of
a
p1, p2,……, pn. ( 0) such that 3  .
b
Now, since a = p1 p2 …… pn, p divides a.
Suppose a and b not having a common factor
We are now ready to give a proof that 2 is other than 1, then we can divide by the
irrational. common factor, and assume that a and b are
coprime.
The proof is based on a technique called
‘proof by contradiction’. So, b 3  a .
Ex.5 Prove that Squaring on both sides, and rearranging, we
(i) 2 is irrational number get 3b2 = a2.
Therefore, a2 is divisible by 3, and by Theorem,
(ii) 3 is irrational number it follows that a is also divisible by 3.
Similarly 5 , 7 , 11 …... are irrational So, we can write a = 3c for some integer c.
numbers. Substituting for a, we get 3b2 = 9c2, that is,
b2 = 3c2.
Sol. (i) Let us assume, to the contrary, that 2 is
rational. This means that b2 is divisible by 3, and so b is
also divisible by 3 (using Theorem with p = 3).
So, we can find integers r and s ( 0) such
r Therefore, a and b have at least 3 as a
that 2  . common factor.
s
But this contradicts the fact that a and b are
Suppose r and s not having a common factor
coprime.
other than 1. Then, we divide by the common
a This contradicts the fact that a and b are
factor to get 2  , where a and b are coprime.
b
coprime. This contradiction has arisen because of our
So, b 2 = a. incorrect assumption that 3 is rational.

Squaring on both sides and rearranging, we So, we conclude that 3 is irrational.

get 2b2 = a2. Therefore, 2 divides a2. Now, by
Theorem it following that 2 divides a. Ex.6 Prove that 7  3 is irrational
So, we can write a = 2c for some integer c. Sol. Method I :
2 2
Substituting for a, we get 2b = 4c , that is,
Let 7  3 is rational number
b2 = 2c2.
This means that 2 divides b2, and so 2 divides p
 7  3  (p, q are integers, q  0)
b (again using Theorem with p = 2). q
Therefore, a and b have at least 2 as a p
common factor.  7   3
q
But this contradicts the fact that a and b have
no common factors other than 1. 7q  p
 3
q
This contradiction has arisen because of our
incorrect assumption that 2 is rational. Here p, q are integers

So, we conclude that 2 is irrational. 7q  p

 is also integer
q
 LHS = 3 is also integer but this is Theorem 1 :
contradiction that 3 is irrational so our Let x be a rational number whose decimal
expansion terminates. Then x can be
assumption is wrong that (7  3 ) is rational p
expressed in the form , where p and q are
q
 7  3 is irrational proved.
coprime and the prime factorization of q is of
Method II : the form 2n5m, where n, m are non-negative
integers.
Let 7  3 is rational
(A) Numbers are terminating (remainder = zero)
we know sum or difference of two rationals is
also rational 32 25 28 256
Eg :  3  3
 3  0.256
125 5 (2  5) 10
 7  (7  3 )
9 9  22 36 36
= 3 = rational Eg :  2 2
 2
  0.36
25 5  2 (2  5) (10) 2
but this is contradiction that 3 is irrational So we can convert a rational number of the
p
 (7  3 ) is irrational proved. form , where q is of the form 2n5m to an
q
Ex.7 Prove that : a
equivalent rational number of the form
b
5 where b is a power of 10. These are
(i) (ii) 2 7 are irrationals
3 terminates.

5 OR
Sol. (i) Let is rational
3 Theorem 2 :

 5 p
 3  = 5 is rational Let x = be a rational number, such that the
 3  q
 
prime factorization of q is of the form 2n 5m,
( product of two rationals is also rational) where n, m are non-negative integers. Then x
has a decimal expansion which terminates.
but this is contradiction that 5 is irrational
(B) Non terminating & recurring
5 1
 is irrational proved. Eg :  0.142857 = 0.142857142857.....
3 7

(ii) Let 2 7 is rational Since denominator 7 is not of the form

2n 5m so we zero (0) will not show up as a
1 remainder.
 (2 7 )   7
2 Theorem 3 :
( division of two rational no. is also p
rational) Let x = be a rational number, such that the
q
 7 is rational prime factorization of q is not of the form
2n5m, where n, m are non-negative integers.
but this is contradiction that 7 is Then, x has a decimal expansion which is
non-terminating repeating (recurring).
irrational
From the discussion above, we can conclude
 2 7 is irrational that the decimal expansion of every rational
number is either terminating or non-
proved terminating repeating.
 Eg : From given rational numbers check (i) Consider number 23 and 5, then:
terminating or non terminating
23 = 5 × 4 + 3
5
13 13 13  2 (13  32) Comparing with a = bq + r; we get:
(1)   
3125 (5) 5 25  55 (10) 5
a = 23, b = 5, q = 4, r = 3
= terminating and 0  r < b (as 0  3 < 5).
3
17 17 17  5 17  125 (ii) Consider positive integers 18 and 4.
(2)  3  3

8 2 (2  5) (10) 3 18 = 4 × 4 + 2
= terminating    For 18 (= a) and 4(= b) we have q = 4,
64 26 r = 2 and 0  r < b.
(3)  ( we can not remove 7
455 5  7  13 In the relation a = bq + r, where 0  r < b is
& 13 from dinominator) non-terminating nothing but a statement of the long division of
repeating ( no. is rational it is always number a by number b in which q is the
repeating or recurring) quotient obtained and r is the remainder.
15 3 5 3  55 3  55 Thus, dividend = divisor × quotient +
(4)  4  
1600 2  10 2 (2  5) 4  10 2 10 6 remainder  a = bq + r

= terminating  H.C.F. (Highest Common Factor)

The H.C.F. of two or more positive integers is the
29 29
(5)  = non terminating largest positive integer that divides each given
343 (7) 3 positive number completely.
23 23  5 23  5 i.e., if positive integer d divides two positive
(6) 3 2
 3
 integers a and b then the H.C.F. of a and b is d.
25 ( 2  5) (10) 3
For Example
= terminating
(i) 14 is the largest positive integer that divides
129 3  43  2 2 28 and 70 completely; therefore H.C.F. of 28
(7) 5 7 5
=
2 5 7 ( 2  5) 7  7 5 and 70 is 14.

= non terminating ( 7 cannot remove (ii) H.C.F. of 75, 125 and 200 is 25 as 25 divides
from denominator) each of 75, 125 and 200 completely and so
on.
6 23 2 2 2
(8)     Using Euclid’s Division Lemma For Finding
15 5  3 5 10 H.C.F.
= terminating Consider positive integers 418 and 33.
35 35  2 Step-1
(9)  = terminating
50 100
Taking bigger number (418) as a and smaller
77 7  11 7  11 number (33) as b
(10)  
210 7  30 7  2  5  3 express the numbers as a = bq + r
= non terminating   418 = 33 × 12 + 22
 EUCLID’S DIVISION LEMMA OR Step-2
 EUCLID’S DIVISION ALGORITHM Now taking the divisor 33 and remainder 22;
apply the Euclid’s division algorithm to get:
For any two positive integers a and b, there exist
unique integers q and r satisfying a = bq + r, 33 = 22 × 1 + 11 [Expressing as a = bq + r]
where 0  r < b. Step-3
For Example
 Again with new divisor 22 and new   Required H.C.F. = 45 (Ans.)
remainder 11; apply the Euclid’s division
(ii) Starting with larger number 38220, we get:
algorithm to get:
38220 = 196 × 195 + 0
22 = 11 × 2 + 0
Since, the remainder is 0
Step-4
Since, the remainder = 0 so we cannot   H.C.F. = 196 (Ans.)
proceed further. (iii) Given number are 867 and 255
Step-5   867 = 255 × 3 + 102 (Step-1)
The last divisor is 11 and we say H.C.F. of 255 = 102 × 2 + 51 (Step-2)
418 and 33 = 11
102 = 51 × 2 + 0 (Step-3)
Verification :
  H.C.F. = 51 (Ans.)
(i) Using factor method:
Ex.9 Show that every positive integer is of the
 Factors of 418 = 1, 2, 11, 19, 22, 38, 209 and form 2q and that every positive odd integer is
418 and, of the from 2q + 1, where q is some integer.
Factor of 33 = 1, 3, 11 and 33. Sol. According to Euclid’s division lemma, if a
Common factors = 1 and 11 and b are two positive integers such that a is
greater than b; then these two integers can be
 Highest common factor = 11 i.e., H.C.F. = 11 expressed as
(ii) Using prime factor method: a = bq + r; where 0  r < b
Prime factors of 418 = 2, 11 and 19. Now consider
Prime factors of 33 = 3 and 11. b = 2; then a = bq + r will reduce to
 H.C.F. = Product of all common prime a = 2q + r; where 0  r < 2,
factors = 11. For any two positive integers a
and b which can be expressed as a = bq + r, where i.e., r = 0 or r = 1
0  r < b, the, H.C.F. of (a, b) = H.C.F. of (q, r) If r = 0, a = 2q + r  a = 2q
and so on. For number 418 and 33
i.e., a is even
418 = 33 × 12 + 22
and, if r = 1, a = 2q + r  a = 2q + 1
33 = 22 × 1 + 11
i.e., a is add;
and 22 = 11 × 2 + 0
as if the integer is not even; it will be odd.
 H.C.F. of (418, 33) = H.C.F. of (33, 22)
Since, a is taken to be any positive integer so
= H.C.F. of (22, 11) = 11. it is applicable to the every positive integer
 EXAMPLES  that when it can be expressed as

Ex.8 Using Euclid’s division algorithm, find the a = 2q

H.C.F. of [NCERT]   a is even and when it can expressed as
(i) 135 and 225 (ii) 196 and 38220 a = 2q + 1; a is odd.
(iii) 867 and 255 Hence the required result.
Sol.(i) Starting with the larger number i.e., 225, we get: Ex.10 Show that any positive odd integer is of the
225 = 135 × 1 + 90 form 4q + 1 or 4q + 3, where q is some
integer.
Now taking divisor 135 and remainder 90, we
get 135 = 90 × 1 + 45 Sol. Let a is b be two positive integers in which a is
greater than b. According to Euclid’s division
Further taking divisor 90 and remainder 45, algorithm; a and b can be expressed as
we get 90 = 45 × 2 + 0
 a = bq + r, where q is quotient and r is Sol. If a and b are two positive integers such that
remainder and 0  r < b. a is greater than b; then according to Euclid’s
division algorithm; we have
Taking b = 4, we get: a = 4q + r,
a = bq + r; where q and r are positive integers
where 0  r < 4 i.e., r = 0, 1, 2 or 3
and 0  r < b.
r = 0  a = 4q, which is divisible by 2 and so Let b = 6, then
is even.
a = bq + r  a = 6q + r; where 0  r < 6.
r = 1  a = 4q + 1, which is not divisible by
2 and so is odd. When r = 0  a = 6q + 0 = 6q;
r = 2  q = 4q + 2, which is divisible by 2 which is even integer
and so is even.
When r = 1  a = 6q + 1
and r = 3  q = 4q + 3, which is not divisible which is odd integer
by 2 and so is odd.
When r = 2  a = 6q + 2 which is even.
   Any positive odd integer is of the form
When r = 3  a = 6q + 3 which is odd.
4q + 1 or 4q + 3; where q is an integer.
When r = 4  a = 6q + 4 which is even.
Hence the required result.
Ex.11 Show that one and only one out of n; n + 2 or When r = 5  a = 6q + 5 which is odd.
n + 4 is divisible by 3, where n is any positive This verifies that when r = 1 or 3 or 5; the
integer. integer obtained is 6q + 1 or 6q + 3 or 6q + 5
and each of these integers is a positive odd
Sol. Consider any two positive integers a and b
number.
such that a is greater than b, then according to
Euclid’s division algorithm: Hence the required result.
a = bq + r; where q and r are positive integers Ex.13 Use Euclid’s Division Algorithm to show that
and 0  r < b the square of any positive integer is either of
the form 3m or 3m + 1 for some integer m.
Let a = n and b = 3, then
Sol. Let a and b are two positive integers such that
a = bq + r  n = 3q + r; where 0  r < 3. a is greater than b; then:
r = 0  n = 3q + 0 = 3q a = bq + r; where q and r are also positive
r = 1  n = 3q + 1 and r = 2  n = 3q + 2 integers and 0  r < b
If n = 3q; n is divisible by 3 Taking b = 3, we get:
If n = 3q + 1; then n + 2 = 3q + 1 + 2 a = 3q + r; where 0  r < 3
= 3q + 3; which is divisible by 3  The value of positive integer a will be
3q + 0, 3q + 1 or 3q + 2
 n + 2 is divisible by 3
i.e., 3q, 3q + 1 or 3q + 2.
If n = 3q + 2; then n + 4 = 3q + 2 + 4
Now we have to show that the squares of
= 3q + 6; which is divisible by 3
positive integers 3q, 3q + 1 and 3q + 2 can be
 n + 4 is divisible by 3 expressed as 3m, or 3m + 1 for some integer
m.
Hence, if n is any positive integer, then one
and only one out of n, n + 2 or n + 4 is Square of 3q = (3q)2
divisible by 3.
= 9q2 = 3(3q2) = 3m; 3 where m is some
Hence the required result. integer.
Ex.12 Show that any positive integer which is of the Square of 3q + 1 = (3q + 1)2
form 6q + 1 or 6q + 3 or 6q + 5 is odd, where
= 9q2 + 6q + 1
q is some integer.
 = 3(3q2 + 2q) + 1 = 3m + 1 for some integer m. Statement : Every composite number can be
decomposed as a product prime numbers in a
Square of 3q + 2 = (3q + 2)2 unique way, except for the order in which the
= 9q2 + 12q + 4 prime numbers occur.
= 9q2 + 12q + 3 + 1 For example :

= 3(3q2 + 4q + 1) + 1 = 3m + 1 for some integer m. (i) 30 = 2 × 3 × 5, 30 = 3 × 2 × 5, 30 = 2 × 5 × 3 and so on.

 The square of any positive integer is either of (ii) 432 = 2 × 2 × 2 × 2 × 3 × 3 × 3 = 24 × 33

the form 3m or 3m + 1 for some integer m. or 432 = 33 × 24.
Hence the required result. (iii) 12600 = 2 × 2 × 2 × 3 × 3 × 5 × 5 × 7
Ex.14 Use Euclid’s Division Algorithm to show that = 23 × 32 × 52 × 7
the cube of any positive integer is either of In general, a composite number is expressed as
the 9m, 9m + 1 or 9m + 8 for some integer m. the product of its prime factors written in
Sol. Let a and b be two positive integers such that ascending order of their values.
a is greater than b; then: e.g., (i) 6615 = 3 × 3 × 3 × 5 × 7 × 7
a = bq + r; where q and r are positive integers = 33 × 5 × 7 2
and 0  r < b. (ii) 532400 = 2 × 2 × 2 × 2 × 5 × 5 × 11 × 11 × 11
Taking b = 3, we get:
 EXAMPLES 
a = 3q + r; where 0  r < 3
Ex.15 Consider the number 6n, where n is a natural
 Different values of integer a are number. Check whether there is any value of
3q, 3q + 1 or 3q + 2. n  N for which 6n is divisible by 7.

Cube of 3q = (3q)3 = 27q3 = 9(3q3) = 9m; Sol. Since, 6 = 2 × 3; 6n = 2n × 3n

where m is some integer.  The prime factorisation of given number 6n
Cube of 3q + 1 = (3q + 1)3  6n is not divisible by 7. (Ans)
3 2 2 3
= (3q) + 3(3q) ×1 + 3(3q) × 1 + 1 Ex.16 Consider the number 12n, where n is a natural
number. Check whether there is any value of
[Q (q + b)3 = a3 + 3a2b + 3ab2 + 1]
n  N for which 12n ends with the digit zero.
= 27q3 + 27q2 + 9q + 1
Sol. We know, if any number ends with the digit
3 2
= 9(3q + 3q + q) + 1 zero it is always divisible by 5.
= 9m + 1; where m is some integer.  If 12n ends with the digit zero, it must be
divisible by 5.
Cube of 3q + 2 = (3q + 2)3
This is possible only if prime factorisation of
= (3q)3 + 3(3q)2 × 2 + 3 × 3q × 22 + 23 12n contains the prime number 5.
= 27q3 + 54q2 + 36q + 8 Now, 12 = 2 × 2 × 3 = 22 × 3
= 9(3q3 + 6q2 + 4q) + 8  12n = (22 × 3)n = 22n × 3n
= 9m + 8; where m is some integer. i.e., prime factorisation of 12n does not
contain the prime number 5.
 Cube of any positive integer is of the
form 9m or 9m + 1 or 9m + 8.  There is no value of n  N for which
Hence the required result. 12n ends with the digit zero. (Ans)

 THE FUNDAMENTAL THEOREM OF  USING THE FACTOR TREE


 ARITHMETIC 
 EXAMPLES 
Ex.17 Find the prime factors of : 2 a
(i) 540 (ii) 21252 (iii) 8232 b
2
(i) 2 540
2 b
2 270 540 divided by 2 gives 270
17
3 135 270 divided by 2 gives 135
Can you find the number on top without
3 45 135 divided by 3 gives 45
finding the other ?
Sol. c = 17 × 2 = 34
3 15 45 divided by 3 gives 15
b = c × 2 = 34 × 2 = 68 and
5 15 divided by 3 gives 5 a = b × 2 = 68 × 2 = 136
5 is a prime number and so cannot be further i.e., a = 136, b = 68 and c = 34. (Ans)
divided by any prime number Yes, we can find the number on top without
finding the others.
  540 = 2 × 2 × 3 × 3 × 3 × 5 = 22 × 33 ×5
Reason: The given numbers 2, 2, 2 and 17
(ii) 2 21252 are the only prime factors of the number on
top and so the number on top = 2 × 2 × 2 × 17
2 10626 = 136
3 5313  USING THE FUNDAMENTAL THEOREM OF
 ARITHMETIC TO FIND H.C.F. AND L.C.M.
7 1771
  EXAMPLES 
11 253
Ex.19 Find the L.C.M. and H.C.F. of the following
23 pairs of integers by applying the Fundamental
theorem of Arithmetic method i.e., using the
  21252 = 2 × 2 × 3 × 7 × 11 × 23 prime factorisation method.
= 22 × 3 × 11 × 7 × 23. (i) 26 and 91 (ii) 1296 and 2520

2 8232 (iii) 17 and 25

(iii)
Sol. (i) Since, 26 = 2 × 13 and, 91 = 7 × 13
2 4116
2 26 and 7 91
2 2058
13 13
3 1029
  L.C.M. = Product of each prime factor
7 343 with highest powers. = 2 × 13 × 7 = 182. (Ans)
i.e., L.C.M. (26, 91) = 182. (Ans)
7 49
H.C.F. = Product of common prime factors
7 with lowest powers. = 13.

  8232 = 2 × 2 × 2 × 3 × 7 × 7 × 7 i.e., H.C.F (26, 91) = 13.

(ii) Since, 1296 = 2 × 2 × 2 × 2 × 3 × 3 × 3 × 3 = 24 × 34
= 2 3 × 3 × 7 3.
and, 2520 = 2 × 2 × 2 × 3 × 3 × 5 × 7
Ex.18 Find the missing numbers a, b and c in the
following factorisation: = 23 × 32 × 5 × 7
 2 1296 2 2520 In example 19 (iii) :

2 648 2 1260 The given numbers 17 and 25 do not have

any common prime factor. Such numbers are
2 324 2 630 called co-prime numbers and their H.C.F. is
always equal to 1 (one), whereas their L.C.M.
2 162 3 315 is equal to the product of the numbers.

3 81 But in case of two co-prime numbers also, the

3 105 product of the numbers is always equal to the
3 27 product of their L.C.M. and their H.C.F.
5 35
As, in case of co-prime numbers 17 and 25;
3 9 7
H.C.F. = 1; L.C.M. = 17 × 25 = 425;
3 product of numbers = 17 × 25 = 425
 L.C.M. = Product of each prime factor with and product of their H.C.F. and L.C.M.
highest powers
= 1 × 425 = 425.
= 24 × 34 × 5 × 7 = 45,360
i.e., L.C.M. (1296, 2520) = 45,360 (Ans)  For any two positive integers :
Their L.C.M. × their H.C.F.
H.C.F. = Product of common prime factors
with lowest powers. = Product of the number
Pr oduct of the numbers
= 23 × 32 = 8 × 9 = 72   (i) L.C.M. =
H.C.F.
i.e., H.C.F. (1296, 2520) = 72. (Ans)
Pr oduct of the numbers
(ii) H.C.F. =
(iii) Since, 17 = 17 L.C.M.
and, 25 = 5 × 5 = 52 L.C.M. H.C.F.
(iii) One number =
  L.C.M. = 17 × 52 = 17 × 25 = 425 Other number
and, H.C.F. = Product of common prime
factors with lowest powers
Ex.20 Given that H.C.F. (306, 657) = 9,
= 1, as given numbers do not have any
common prime factor. find L.C.M. (306, 657)
In example 19 (i) : Sol. H.C.F. (306, 657) = 9 means H.C.F. of
Product of given two numbers = 26 × 91 306 and 657 = 9
= 2366
Required L.C.M. (306, 657) means required
and, product of their L.C.M. of 306 and 657.
L.C.M. and H.C.F. = 182 × 13 = 2366 For any two positive integers;
  Product of L.C.M and H.C.F of two Pr oduct of the numbers
given numbers = Product of the given their L.C.M. =
Their H.C.F.
numbers
In example 19 (ii) : 306 657
i.e., L.C.M. (306, 657) = = 22,338.
9
Product of given two numbers
Ex.21 Given that L.C.M. (150, 100) = 300, find
= 1296 × 2520 = 3265920 H.C.F. (150, 100)
and, product of their Sol. L.C.M. (150, 100) = 300 
L.C.M. and H.C.F. = 45360 × 72 = 3265920    L.C.M. of 150 and 100 = 300
 L.C.M. (1296, 2520) × H.C.F. (1296, 2520) Since, the product of number 150 and 100
= 1296 × 2520 = 150 × 100
 And, we know : Ex.23 Explain why 7 × 11 × 13 + 13 and
Pr oduct of 150 and 100 7 × 6 × 5 × 4 × 3 + 5 are composite numbers.
H.C.F. (150, 100) =
L.C.M. (150,100) Sol. Since,
150 100 7 × 11 × 13 + 13 = 13 × (7 × 11 + 1)
= = 50.
300 = 13 × 78 = 13 × 13 × 3 × 2;
Ex.22 The H.C.F. and L.C.M. of two numbers are that is, the given number has more than two
12 and 240 respectively. If one of these factors and it is a composite number.
numbers is 48; find the other numbers.
Similarly, 7 × 6 × 5 × 4 × 3 + 5
Sol. Since, the product of two numbers
= 5 × (7 × 6 × 4 × 3 + 1)
= Their H.C.F. × Their L.C.M.
= 5 × 505 = 5 × 5 × 101
 One no. × other no. = H.C.F. × L.C.M.
The given no. is a composite number.
12 240
 Other no. = = 60.
48
 EXERCISE
Q.1 State whether the given statement is true or Q.7 Without actual divison, show that each of the
false : following rational numbers is a terminating
(i) The sum of two rationals is always rational decimal. Express each in decimal form :
(ii) The product of two rationals is always 23 24 17
rational (i) 3 2 (ii) (iii)
(2  5 ) 125 320
(iii) The sum of two irrationals is an irrational.
(iv) The product of two irrationals is an 171 15 19
(iv) (v) (vi)
irrational 800 1600 3125
(v) The sum of a rational and an irrational is
irrational Q.8 Express each of the following as a fraction in
(vi) The product of a rational and an irrational simplest form :
is irrational (i) 0. 8 (ii) 2. 4 (iii) 0.24
Q.2 Define (i) rational numbers (ii) irrational (iv) 0.12 (v) 2.24 (vi) 0.365
numbers (iii) real numbers.
Q.3 Classify the following numbers as rational or Q.9 Decide whether the given number is rational or
irrational : not :
22 (i) 53.123456789 (ii) 31.123456789
(i) (ii) 3.1416
7 (iii) 0.12012001200012...
(iii)  (iv) 3.142857 Give reason to support your answer.
 (v) 5.636363...... (vi) 2.040040004......
(vii) 1.535335333.... (viii) 3.121221222... Q.10 What do you mean by Euclid's division
3
(ix) 21 (x) 3 algorithm.
Q.4 Prove that each of the following numbers is
irrational : Q.11 A number when divided by 61 gives 27 as
(i) 6 (ii) (2  3 ) quotient and 32 as remainder. Find the number.

(iii) (3  2 ) (iv) (2  5 )
Q.12 By what number should 1365 be divided to get
(v) (5  3 2 ) (vi) 3 7 31 as quotient and 32 as remainder ?
3
(vii) (viii) (2  3 5 )
5 Q.13 Using Euclid's algorithm, find the HCF of
(ix) ( 3  5 ) (i) 405 and 2520 (ii) 504 and 1188
(iii) 960 and 1575
1
Q.5 Prove that is irrational.
3 Q.14 Using prime factorisation, find the HCF and
LCM of
Q.6 Without actual division, show that each of the
following rational numbers is a non-terminating (i) 144, 198 (ii) 396, 1080
repeating decimal : (iii) 1152, 1664
11 73 9
(i) 3 (ii) 3 3 (iii)
( 2  3) ( 2  3  5) 35 Q.15 Using prime factorisation, find the HCF and
LCM of
32 64 77
(iv) (v) (vi) (i) 24, 36, 40
147 455 210
29 129 (ii) 30, 72, 432
(vii) (viii) 2 7 (iii) 21, 28, 36, 45
343 (2  5  7 5 )
Q.16 The HCF of two numbers is 23 and their LCM Q.23 Three measuring rods are 64 cm, 80 cm and
is 1449. If one of the numbers is 161, find the 96 cm in length. Find the least length of cloth
other. that can be measured an exact number of times,
using any of the rods.
Q.17 The HCF of two numbers is 11 and their LCM
Q.24 The traffic lights at three different road
is 7700. If one of the numbers is 275, find the
crossings change after every 48 seconds,
other.
72 seconds and 108 seconds respectively. If
Q.18 Three pieces of timber 42 m, 49 m and 63 m they all change simultaneously at 8 hours, then
long have to be divided into planks of the same at what time will they again change
length. What is the greatest possible length of simultaneously ?
each plank ?
Q.25 An electronic device makes a beep after every
Q.19 Find the greatest possible length which can be 60 seconds. Another device makes a beep after
used to measure exactly the length 7 m, 3 m 85 cm every 62 seconds. They beeped together at
and 12 m 95 cm. 10 am. At what time will they beep together at
the earliest ?
Q.20 Find the maximum number of students among
whom 1001 pens and 910 pencils can be Q.26 Six bells commence tolling together and toll at
distributed in such a way that each student gets intervals of 2, 4, 6, 8, 10, 12 minutes
the same number of pens and the same number respectively. In 30 hours, how many times do
of pencils. they toll together ?

Q.21 Three sets of English, Mathematics and Science

books containing 336, 240 and 96 books
respectively have to be stacked in such a way
that all the books are stored subject wise and
the height of each stack is the same. How many
stacks will be there ?
Q.22 Find the least number of square tiles required to
pave the ceiling of a room 15 m 17 cm long and
9 m 2 cm broad.
 ANSWER KEY
1. (i) True (ii) True (iii) False (iv) False (v) True (vi) True
3. (i) Rational (ii) Rational (iii) Irrational (iv) Rational (v) Rational (vi) Irrational
(vii) Irrational (viii) Irrational (ix) Irrational (x) Irrational
7. (i) 0.115 (ii) 0.192 (iii) 0.053125 (iv) 0.21375 (v) 0.009375 (vi) 0.00608
8 22 8 11 101 181
8. (i) (ii) (iii) (iv) (v) (vi)
9 9 33 90 45 495
9. (i) Rational, since it is a terminating decimal (ii) Rational, since it is a repeating decimal
(iii) Not rational, since it is a non-terminating and non-repeating decimal
11. 1679 12. 43 13. (i) 45 (ii) 36 (iii) 15
14. (i) HCF = 18, LCM = 1584 (ii) HCF = 36, LCM = 11880 (iii) HCF = 128, LCM = 14976
15. (i) HCF = 4, LCM = 360 (ii) HCF = 6, LCM = 2160 (iii) HCF = 1, LCM = 1260
16. 207 17. 308 18. 7 m 19. 35 cm 20. 91 21. 14
22. 814 23. 9.6 m 24. 8 : 7 : 12 hrs 25. 10 : 31 hrs 26. 16 times