1 Real Numbers

Euclid’s lemma. This unit facilitates you in,

Fundamental theorem of
stating Euclid’s lemma.
arithmetic.
Corollaries. finding HCF of two numbers using
HCF of numbers. Euclid’s division algorithm.

stating fundame ntal the orem of

arithmetic.

proving the corollaries.

proving that 2, 3 , 5 ... are irrational

numbers.

Euclid of Alexandria, 300 B.C.

He founded the school of

mathematics in the university of
Mathematics is the queen of sciences,
Alexandria. He was the first to
and Arithmetic is the queen of Mathematics.
prove that there are infinitely
-C.F. Gauss
many prime numbers. He devised
Euclid’s algorithm for computing
HCF. He proved that there are only
5 ‘Platonic solids’. He is the author
of the comprehensive mathematics
book, "The Elements" having
13 volumes.He is often referred to
as "Father of Geometry"
 2 UNIT-1

We are familiar with the different types of numbers and their relationship. Observe the
following figure.

Q Q
Z
W
N

We have also studied the fundamental operations performed on these numbers and their
important properties. These properties have helped you to solve many problems in
mathematics and other subjects.
Now let us learn more about real numbers, its properties and applications.
First, let us consider a popular puzzle on numbers.
A shed can hold not more than 120 sheep,
If counted in two's one will remain,
If counted in three's two will remain,
If counted in four's three will remain,
If counted in five's four will remain,
If counted in six's five will remain,
If counted in seven's no sheep will remain.
How many sheep are there in the shed?
Can you solve this puzzle? Which number property can be used to verify the result?
Let us learn the property and then solve the puzzle.
Divisibility of Integers
We are familiar with the fundamental operation of division.
We say that a number 'a' divides 'b' if b = ka for some natural number k.
Whenever a dividend is divided by a divisor, we get the corresponding quotient and
remainder. These four terms are related as,
Dividend = (Divisor × quotient) + remainder Lemma: It is a minor result
Consider 'a' as the dividend, 'b' as the divisor,whose sole purpose is to
help in proving a theorem.
'q ' as the quotient and 'r ' as the remainder.
A Lemma is a stepping
then, these terms are related by, a = (b × q) + r stone in the path of proving
a theorem. So, a Lemma is
This familiar relation is named after the father of
a proven statement used to
geometry, the great mathematician Euclid. It is called
prove another statement.
EUCLID'S DIVISION LEMMA.
Real Numbers 3

Euclid's division lemma is stated as follows :

Given positive integers 'a' and 'b' there exist unique integers 'q' and 'r' satisfying
a = bq + r, 0  r < b

This is a well known result, which was first recorded An algorithm is a series of
in Book VII of Euclid's "The Elements". well defined steps which
gives a procedure for solving
There are several applications of this lemma. Using
a problem.
this lemma, HCF of two positive integers can be found easily.
This method is called Euclid's division algorithm.
Recall that HCF of two positive integers 'a' and 'b' is
Note : (a, b) means
the largest positive integer 'c' which can divide both 'a' and
'b'. HCF of any two numbe rs is also calle d their HCF of a and b
Greatest Common Divisor (GCD).
Consider the example of finding HCF of 40 and 735. We have already learnt to find
HCF by factorisation method,
Now, let us learn to find HCF of two numbers by Euclid's divison algorithm.
Step 1: Consider 40 and 735 Step 2: Consider a = 40 and b = 15
Let a = 735 and b = 40

40)735 (18 Here , q 18, r 15

15)40(2 Here , q 2, r 10
40 By Euclid's lemma,
30 By Euclid's lemma,
335 a = (b × q) + r
10 a = (b × q) + r
320 735 = (40 × 18)+15
40 = (15 × 2) + 10
15

Step 3: Consider a = 15 and b = 10 Step 4: Consider a = 10 and b = 5

10)15(1 Here , q 1, r 5 Here , q 2, r 0

5)10(2
10 By Euclid's lemma, By Euclid's lemma,
10
5 a = (b × q) + r a = (b × q) + r
00
15 = (10 × 1) + 5 10 = (5 × 2) + 0
Since the remainder is zero, the HCF is the divisor in step 4.
i.e., HCF of 735 and 40 is 5.
Try : You can verify the result by listing all the factors of 735 and 40.
Example 2 : Find the HCF of 513 and 783
Step 1: Consider a = 783 and b = 513 Step 2: Consider a = 513 and b = 270

513)783(1 Here q 1, r 270 270) 513 (1 Here q 1, r 243

513 By Euclid's lemma, 270 By Euclid's lemma,
270 a = (b × q) + r 243 a = (b × q) + r
783 = (513 × 1) + 270 513 = (270 × 1) + 243
 4 UNIT-1

Step 3: Consider a = 270 and b = 243 Step 4: Consider a = 243 and b = 27

243)270(1 Here q 1, r 27 27)243(9 Here q 9, r 0
243 By Euclid's lemma, 243 The last non-zero
27 a = (b × q) + r remainder is 27.
0
270 = (243 × 1) + 27
HCF of 783 & 513 is 27.
In general, to obtain the HCF of two positive integers 'x' and 'y' with x > y using
Euclid's division algorithm, we follow these steps.
Note :
Step 1 : Apply Euclid's lemma to 'x ' and 'y' such that
If the divisor is a factor of
x = (y × q) + r, 0  r < y the dividen d, the l ast
where q is the quotient and r is the remainder. remainder will be zero.
The last but one non-zero
Step 2 : If r = 0, y is the HCF of x and y remainder will be the
If r  0, apply Euclid's lemma to 'y' and 'r ' H.C.F.

Step 3 : Continue the process till the remainder is zero.

The divisor at this stage (non-zero remainder) is the HCF of the given positive
integers.
THINK !
Try :
What happens to the HCF of
Solve the puzzle on number two numbers when
of sheep, discussed in the * any one number is zero
begining of this unit. * both the numbers are zero.

ILLUSTRATIVE EXAMPLES

Example 1 : Find the largest number that divides 455 and 42 with the help of division
algorithm.
Sol. i) Start with the larger integer, 455

42)455 (10 quotient

420
35 remainder  455 = (42 × 10) + 35 (By Euclid's lemma)

ii) Consider 42  35 iii) Consider 35  7

35)42(1 7)35(5
35 35
7 00
 42 = (35 × 1) + 7  35 = (7 × 5) + 0
HCF (455, 42) = HCF (42, 35) = HCF (35, 7) = 7.
 7 is the largest number that divides 455 and 42.
Real Numbers 5

Example 2 : Show that every positive even integer is of the form 2q and every positive
odd integer is of the form 2q + 1, where q is a whole number.
Sol. (i) Let 'a' be an even positive integer.
Apply division algorithm with a and b, where b = 2
a = (2 × q) + r where 0  r < 2
a = 2q + r where r = 0 or r = 1
since 'a' is an even positive integer, 2 divides ‘a’.
  r=0 a = 2q + 0 = 2q
Hence, a = 2q when ‘a’ is an even positive integer.
(ii) Let 'a' be an odd positive integer.
apply division algorithm with a and b, where b = 2
a = (2 × q) + r where 0  r < 2
a = 2q + r where r = 0 or 1
Here, r 0 ( a is not even) r=1
 a = 2q + 1
Hence, a = 2q + 1 when ‘a’ is an odd positive integer.
Example 3 : Use Euclid's division lemma to show that cube of any positive integer is
either of the form 9m, 9m + 1 or 9m + 8 for some integer 'm'.
Sol. Let a and b be two positive integers, and a > b
a = (b × q) + r where q and r are positive integers and 0 rb
Let b = 3  a = 3q + r where 0  r  3
(i) if r = 0, a = 3q (ii) if r = 1, a = 3q + 1 (iii) if r = 2, a = 3q + 2
Consider, cubes of these
Case (i) a = 3q
a3 = (3q)3 = 27q3 = 9(3q3) = 9m where m=3q3 and 'm' is an integer.
Case (ii) a = 3q + 1
a3 = (3q + 1)3 [(a + b)3 = a3 + b3 + 3a2b + 3ab2]
= 27q3 + 1 + 27q2 + 9q = 27q3 + 27q2 + 9q + 1
= 9(3q3 + 3q2 + q) + 1 = 9m + 1,
where m=3q3 + 3q2 + q and 'm' is an integer.
Case (iii) a = 3q + 2
a3 = (3q + 2)3 = 27q3 + 8 + 54q2 + 36q
= 27q3 + 54q2 + 36q + 8 = 9 (3q3 + 6q2 + 4q) + 8
= 9m + 8, where m = 3q3 + 6q2 + 4q and m is an integer.
cube of any positive integer is either of the form 9m, 9m+1 or 9m+8 for some
integer m.
 6 UNIT-1

Example 4 : Prove that, if x and y are odd positive integers, then x2 + y2 is even but not
divisible by 4.
Sol: We know that any odd positive integer is of the form 2q + 1, where q is an integer.
So, let x = 2m + 1 and y = 2n + 1, for some integers m and n.
we have x2 + y2
x2 + y2 = (2m + 1)2 + (2n + 1)2
x2 + y2 = 4m2 + 1 + 4m + 4n2 + 1 + 4n = 4m2 + 4n2 + 4m + 4n + 2
x2 + y2 = 4(m2 + n2) + 4(m + n) + 2 = 4{(m2 + n2) + (m + n)} + 2
x2 + y2 = 4q + 2, when q = (m2 + n2)+(m + n)
x2 + y2 is even and leaves remainder 2 when divided by 4.
x2 + y2 is even but not divisible by 4.
Example 5 : A book seller has 28 Kannada and 72 English books. The books are of the
same size. These books are to be packed in separate bundles and each bundle must
contain the same number of books. Find the least number of bundles which can be
made and also the number of books in each bundle.
Sol: Number of Kannada books = 28 Number of English books = 72
We have to find the HCF of 28 and 72 by Euclid's lemma.
72 = (28 × 2) + 16
28 = (16 × 1) + 12
16 = (12 × 1) + 04
12 = (4 × 3) + 0
 HCF of 28 and 72 = 4  Each bundle contains 4 books.

28 72
No. of bundles of Kannada books = = 7, No. of bundles of English books = = 18
4 4

EXERCISE 1.1

1. Use Euclid's division algorithm to find the HCF of the following numbers
(i) 65 and 117 (ii) 237 and 81 (iii) 55 and 210 (iv) 305 and 793.
2. Show that any positive even integer is of the form 4q or 4q + 2, where q is a whole
number.
3. Use Euclid's division lemma to show that the square of any positive integer is either
of the form 3m or 3m + 1 for some integer m, but not of the form 3m+2.
4. Prove that the product of three consecutive positive integers is divisible by 6.
5. For any positive integer n, prove that n3-n is divisible by 6.
6. There are 75 roses and 45 lily flowers. These are to be made into bouquets containing
both the flowers. All the bouquets should contain the same number of flowers. Find
the number of bouquets that can be formed and the number of flowers in them.
7. The length and breadth of a rectangular field is 110m and 30m respectively. Calculate
the length of the longest rod which can measure the length and breadth of the field
exactly.
Real Numbers 7

FUNDAMENTAL THEOREM OF ARITHMETIC Prime number

We know that any natural number can be written as a A positive inte ger ‘p’ is
product of its prime factors. considered a prime number, if
Example : 21 = 3 × 7 i) p>1 and
88 = 2 × 2 × 2 × 11 ii) p does not have factors
other than 1 and p.
3825 = 3 × 3 × 5 × 5 × 17
The converse of the above statement is also true. That is, if we multiply positive prime
numbers, we can produce a natural number or positive integer.
Example : 3 × 11= 33 11 × 2 × 2 = 44 3 × 3 × 3 × 7 = 189
Similarly, if we include all possible primes, we will get an infinite collection of
numbers containing all primes and all possible products of primes.
Does this collection also have composite numbers?
Are there composite numbers which are not the product of primes?
Let us try to find an answer to this. Consider a composite number and list its factors
through a factor tree.

Composite number :
2 15,708
A number greater than 1
and not a prime number is
a composite number.
2 7,854

2 3,927

3 1,309
 31,416 = 2 × 2 × 2 × 3 × 7 × 11 × 17

7 187 31,416 = 23 × 3 × 7 × 11 × 17

11 17

This is known as prime factorisation or canonical factorisation.

Take some composite numbers and try prime factorisation.
You will find that every composite number can be expressed as a product of its primes.
This is called the FUNDAMENTAL THEOREM OF ARITHMETIC.
Fundamental theorem of arithmetic is stated as follows:
Every composite number can be expressed as a product of primes and this
factorisation is unique except for the order in which the prime factors occur.
Note that, for any given composite number, there is one and only one way to write
it as a product of primes as long as we are not particular about the order in which the
factors are listed.
By listing the prime factors of the given numbers, their HCF and LCM can be found
easily.
 8 UNIT-1

ILLUSTRATIVE EXAMPLES

Example 1 : Find the HCF and LCM of 18 and 45 by prime factorisation method.
Sol. Express 18 and 45 as product of primes.

18= 2 × 3 × 3 = 2 × 3
45= 3 × 3 × 5 = 32 × 5

 HCF of 18 and 45 = 3 × 3 = 9
LCM of 18 and 45 = 3 × 3 × 2 × 5 = 90
Recall : HCF of any 2 positive integers is the product of the smallest power of each common
prime factor of the numbers.
LCM of any 2 positive integers is the product of the greatest power of each factor of the
numbers.
Example 2 : Find the HCF and LCM of 42 and 72 by prime factorisation method i.e., by
fundamental theorem of arithmetic.
Sol. 42 = 2 × 3 × 7
72 = 2 × 2 × 2 × 3 × 3 = 23 × 32
 HCF (42, 72) = 2 × 3 = 6
LCM (42, 72) = 23 × 32 × 71 = 504
Observe that 42 × 72 = 3,024
HCF (42, 72) × LCM (42, 72) = 6 × 504 = 3,024
 42 × 72 = HCF(42, 72) × LCM (42, 72)
 For any two positive integers a and b,
HCF (a, b) × LCM (a, b) = a × b
This relation can be used to find the LCM of two positive integers, if their HCF has
already been found.
Example 3 : Find the HCF of 344 and 60 by prime factorisation method. Hence find
their LCM.
Sol. 344 = 2 × 2 × 2 × 43 = 23 × 43
60 = 2 × 2 × 3 × 5 = 22 × 3 × 5
 HCF (344, 60) = 22
We know that, LCM (a, b) × HCF (a, b) = a × b
a b
 LCM (a, b) =
HCF(a, b )
15
30
344 60
LCM (344, 60) = = 5160
2 2
Real Numbers 9

Example 4 : Find the largest positive integer that will divide 150, 187 and 203 leaving
remainders 6, 7 and 11 respectively.
Sol. It is given that on dividing 150 by the required number, the remainder will be 6.
 150 6 = 144
 144 is exactly divisible by the required number.
 the required number is a factor of 144.
Similarly, required positive integer is a factor of
187  7=180 and 203 11 =192.
 the required positive integer is the HCF of 144, 180 and 192.
By prime factorisation, 144 = 24  32 180 = 22  32  5 192 = 26  3
 HCF (144, 180, 192) = 22  3 = 12
Hence, the required positive integer is 12.
 12 is the largest positive integer that will divide 150, 187 and 203 leaving
remainders 6, 7 and 11 respectively.
Example 5 : Find the smallest number that, when divided by 35, 56 and 91 leaves
remainders of 7 in each case.
Sol. If the number is divisible by 35, 56 and 91 then it is the LCM of these numbers.
Find the LCM by prime factorisation
35 = 5  7 56 = 23  7 91 = 7  13
 LCM of 35, 56, 91 = 23  5  7  13 = 3,640
 The least number divisible by 35, 56 and 91 is 3,640.
Since it leaves a remainder 7, the required number is 3,640 + 7 = 3,647
Example 6 : There is a circular path around a sports field. Sheela takes 36 minutes to
drive one round of the field while Geeta takes 32 minutes to do the same. If they both
start at the same point and at the same time and go in the same direction, after how
many minutes will they meet again at the starting point?
Sol. To find this, we have to find the LCM of 36 and 32
36 = 2 × 2 × 3 × 3 = 22 × 32 32 = 2 × 2 × 2 × 2 × 2 = 25
 LCM (36, 32) = 25 × 32 = 32 × 9
LCM (36, 32) = 288
 Sheela and Geeta meet again at the starting point after 288 minutes.
Example 7 : (7 × 11 × 13 + 13) is a composite number. Justify the statement.
Sol. (7 × 11 × 13) + 13 = 13 [(7 × 11) + 1] = 13[77 + 1] = 13 × 78
 It is a composite number
10 UNIT-1

EXERCISE 1.2

1. Express each number as a product of prime factors

(i) 120 (ii) 3825 (iii) 6762 (iv) 32844

x1 x2 x3 x4
2. If 25025 = p . p2 . p3 . p4
1 find the value of p1, p2, p3, p4 and x1, x2, x3, x4.

3. Find the LCM and HCF of the following integers by expressing them as product of
primes.

(i) 12, 15 and 30 (ii) 18, 81 and 108

4. Find the HCF and LCM of the pairs of integers and verify that
LCM (a, b) × HCF (a, b) = a × b.

(i) 16 and 80 (ii) 125 and 55

5. If HCF of 52 and 182 is 26, find their LCM.

6. Find the HCF of 105 and 1515 by prime factorisation method and hence find its LCM.

7. Find the smallest number which when increased by 17 is exactly divisible by both
520 and 468.

8. A rectangular hall is 18m 72cm long and 13m 20cm broad. It is to be paved with
square tiles of the same size. Find the least possible number of such tiles.

9. In a school, the strength in 8th, 9th and 10th standards are respectively 48, 42 and 60.
Find the least number of books required to be distributed equally among the students
of 8th, 9th and 10th Standard.

10. x, y and z start at the same time in the same direction to run around a circular
stadium. x completes a round in 126 seconds, y in 154 seconds and z in 231 seconds,
all starting at the same point. After what time will they meet again at the starting
point? How many rounds would have x, y and z completed by this time?

IRRATIONAL NUMBERS

In class IX you have been introduced to irrational numbers.

p
Recall that a number is called irrational if it cannot be written in the form
q
where p and q are integers and q  0. Ex : 2, 3 , 5 etc

Now, let us prove that 2, 3, 5 etc are irrational.

i.e., in general, p is irrational where p is prime number.

Before we prove the irrationality of these numbers, we need to learn and prove a
theorem whose proof is based on fundamental theorem of arithmetic.
Real Numbers 11

Theorem : If a prime number p divides a2, then p divides a, where a is a positive

integer.
Proof : Let a = p1 × p2 × ........pn where p1, p2.....pn are prime factors of ‘a’
Squaring on both sides,
a2= (p1 × p2 × ......× pn)2
but, p divides a2 [ data]
p is a factor of p12 × p22 × .......pn2
by fundamental theorem of arithmetic, the primes in the factorisation of
p12 × p22 × p32 × .........×pn2 are unique.
p is one out of the primes p1, p2 .......pn
if p = pk for some value of k from 1 to n,
pk divides p1 × p2 × p3 × .....pn
pk divides a p divides a [ pk = p]
Now let us prove that 2 is an irrational number.
Co-primes
Proof : Let us assume that 2 is a rational number. Two numbers 'a' and 'b' are
p said to be co-prime if the
 there exists integers p and q such that, 2= q only common divisor of
a and b is 1
where, p and q are co-prime to each other.
 2 q =p
squaring on both sides, 2q2 = p2 2 divides p2
 2 divides p p is even
Let, p = 2k where k is an integer
Now, 2q2 = (2k)2, 2q2 = 4k2
q2 = 2k2 q is even
 both p and q are even.
p and q have a common factor 2.
This is contradictory to our assumption that p and q are co-prime.
our assumption that 2 is a rational number is wrong. Try to prove that
 2 is an irrational number. 3 is irrational.
Corollary 1: If 'a' divides bc and HCF (a, b) = 1 then a divides c.
Proof: Let a divide bc, 'k' times (k Z) ak = bc
Note:
for x, y Z, ax + by = 1
If d is the HCF of 2 numbers
multiply both sides by 'c', acx + bcy = c
x and y, there exists a, b z
but, bc = ak  acx + aky = c a (cx + ky) = c such that ax + by = d
a divides c.
12 UNIT-1

Corollary 2 : If a prime divides the product of two integers, then it divides atleast one
of them.
i.e., if p is a prime and p ab then p a or p b. Note :
Read,
Proof : Let us assume p a then we must show that p b
p ab as p divides ab
for x, y z, xp + ya = HCF (p, a) p a as p divides a
Since p is prime and p a, HCF (p, a) = 1, xp + ya = 1 p b as p divides b

Multiply both sides by 'b', xbp + yba = b p a as p does not divide a

since p ab and p xbp, p (xpb + yba)  p b

ILLUSTRATIVE EXAMPLES

Example 1.Prove that 5 3 is an irrational number.

Sol. Let us suppose, 5 3 is a rational number
p
5 3 = q , where p, q z, q 0

p 5q p 5q p
5– = 3 = 3 3 is a rational number  is rational
q q q

but 3 is not a rational number. This gives us a contradiction.

 our supposition that 5 3 is a rational number is wrong
5 3 is an irrational number.
Example 2.Prove that 3 2 is an irrational number.
Sol. Let us suppose 3 2 be a rational number

p
3 2= , where p, q z,q0
q
2
p 2 p
3= 2 , By squaring on both the sides, 3 = 2
q q

p2 p
3 = 2. 2. 2
q2 q

p p2 p p2
2 2. = 2 2 3  2 2. = 2 1
q q q q

p p2 q 2
2 2 =
q q2
Real Numbers 13

p2 q 2 q
2 =
q2 2p

p2 q 2
2 =
2 pq

p2 q 2
2 is a rational number  is rational.
2 pq

But 2 is not a rational number. This leads us to a contradiction.

 our supposition that 3 2 is a rational number is wrong

3 2 is an irrational number.

EXERCISE 1.3
1. Prove that 5 is an irrational number.
2. Prove that the following are irrational numbers.

7
(i) 2 3 (ii) (iii) 3 5
4

(iv) 2 5 (v) 2 3 4

Real Numbers

Euclid's Division Irrational numbers

algorithm Fundamental theorem
of arithmetic ( 2 , 3 ......)
a = (b×q) + r, o r < b

Finding HCF of two Finding HCF and LCM Theorem : If p is a

integers using using fundamental prime number and
Euclid's division theorem of arithmetic p a2, then p a
algorithm

Corollary 1 Corollary 2
If a bc and If p is a prime and
HCF (a,b) = 1 then a c p ab, then p a or p b
14 UNIT-1

ANSWERS
EXERCISE 1.1
1] (i) 13 (ii) 3 (iii) 5 (iv) 61
6] Number of bouquets = 8, Number of flowers in each bouquet = 15
7] 10m
EXERCISE 1.2

1] (i) 23 × 3 × 5 (ii) 32 × 52 × 17
(iii) 2 × 3 × 72 × 23 (iv) 22 × 3 × 7 × 17 × 23
2] p1 = 5, p2 = 7, p3 = 11, p4 = 13, x1 = 2, x2 = 1, x3 = 1, x4 = 1
3] (i) HCF = 3, LCM = 60 (ii) HCF = 9, LCM = 324
5] 364 6] 15; 10,605 7] 4,663
8] 4,290 9] 1,680
10] after 1,386 seconds x  11 rounds y  9 rounds z  6 rounds