REAL NUMBERS

EUCLID’S
S DIVISION ALGORITHM

1) Use Euclid’s division algorithm to find the HCF of 1362 and 6954
Solution:
STEP 1:: Since 6954>1362 we apply division lemma to 6954 and 1362 to get,
6954 = 1362 x 5 + 144
STEP 2: Since the remainder 144 ≠ 0 we apply the division lemma to 1362 and 144
1362 = 144 x 9+66
STEP 3: Since the remainder 66 ≠ 0 wee apply the division lemma to 144 and 66
144 = 66 x 2+12
STEP 4: Since the remainder 12 ≠ 0 we apply the division lemma to 66 and 12
66 = 12 x 5+6
STEP 5: Since the remainder 6 ≠ 0 we apply the division lemma to 12 and 6
12 = 6 x 2+0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 6, the
HCF of 1362 and 6954 is 6.

2) Show that any positive odd integer is of the form 8q+1, or 8q+3, or 8q+5, or 8q+7,
+7 where q is some integer
Solution:
Let’s start with taking a, where a is a positive odd integer. We apply the division algorithm with a
and b =8
Since 0 ≤ r < 8 the possible remainders are 0,1,2,3,4,5,6 and 7

That is, a can be 8q or 8q+1 or 8q+2

+2 or 8q+3 or 8q+4 or 8q+5 or 8q+6 or 8q+7 where q is the quotient.
However, since a is odd a cannot be 8q or 8q+2 or 8q+4 or 8q+6 (since they are divisible by 2)
Therefore any odd integer can only be of the form 8q + 1 , or 8q + 3 , or 8q + 5 , or 8q + 7

3) A fruit seller has 56 red apples and 32 green apples. She wants to stack them in such a way that each stack
has the same number, and they take up the least area of the tray. What is the maximum number of apples
that can be placed in each stack for this purpose?
Solution:
To find the solution we have to first
irst find the HCF of 56 and 32
32. Then this number will give us the
maximum number of apples in each stack and as a result the number of stacks will be least and they will
take up least amount of space.

We use Euclid’s division algorithmhm to find the HCF of 56 and 32

56 = 32 x 1 + 24
Since, 24 ≠ 0 ∴ 32 = 24 x 1 + 8
8≠0 24 = 8 x 3 + 0
So the HCF of 56 and 32 is 8.
Therefore the fruit seller has to make stacks
s of 8 for both kinds of apples.
 REAL NUMBERS

EUCLID’S
S DIVISION ALGORITHM

4) Prove that one of every four consecutive integers is divisible by 4.

Solution:
Let the four consecutive integers be n,n+1,n+2
n,n and n+3.
Consider a = bq + r, where 0 ≤ r < b
Let a=n and b=4. Hence r can have values 0,0 1, 2 or 3.
CASE 1: Let r=0 ∴ n = 4 q which is divisible by 4 :

CASE 2: Let r=1 ∴ n = 4 q +1 then n + 3 = 4 q + 1 + 3 = 4q + 4 = 4(q + 1) which is divisible by 4 :

CASE 3: Let r=2 ∴ n = 4 q +2 then n + 2 = 4 q + 2 + 2 = 4q + 4 = 4( q + 1) which is divisible by 4 :

CASE 4: Let r=3 ∴ n = 4 q +3 then n + 1 = 4 q + 3 + 1 = 4 q + 4 = 4( q + 1) which is divisible by 4

Thus in every case one of the four numbers

numbe is divisible by 4.
:
5) 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.
Solution:
Let n be any positive integer. Consider a=bq+r where 0 ≤ r < b
Let a=n and b=3. Hence r can have values 0,1 or 2.
CASE 1: Let r=0 then n =3q ∴ n 2 = (3q) 2 = 9q 2 = 3(3q 2 ) = 3m where m = 3q2
CASE 2: Let r=1 then n = 3q + 1 ∴ n 2 = (3q + 1) 2
= 9q 2 + 6q + 1
= 3(3q 2 + 2q) + 1
= 3m + 1 where m = 3q 2 + 2q
CASE 2: Let r=2 then n = 3q + 2 ∴ n 2 = (3q + 2) 2
= 9q 2 + 12q + 4
= 9q 2 + 12q + 3 + 1 = 3(3q 2 + 4q + 1) + 1
= 3m + 1 where m = 3q 2 + 4q + 1
Therefore n 2 is always of the form 3m or 3m+1
 REAL NUMBERS

THE FUNDAMENTAL THEOREM OF ARITHEMATICS

6) Find the HCF and LCM of the following pairs of numbers and verify that HCF x LCM=Product of the two
numbers.
a)39 and 169 b) 436 and 594

Solution: a) 39 and 169

Factors of the two numbers are
39 = 3 x 13
169 = 13 x 13
HCF(39,169) = 13
LCM(39,169) = 3 x 13 x 13=507
HCF x LCM = 13 x 507= 6591
Product of the numbers =39 x 169=6591

HCF x LCM= Product of the numbers

b)436 and 594

Factors of the two numbers are
436=2 x 2 x 109
594=2 x 3 x 3 x 3 x 11
HCF(436,594) = 2
LCM(436,594) = 2 x 2 x 3 x 3 x 3 x 11 x 109=129492
HCF x LCM = 2 x 129492=258984
Product of the two numbers = 436 x 594= 258984

∴ HCF x LCM= Product of the numbers

7) If HCF(90,225)=15, find LCM(90,225)

Solution:: We know that HCF x LCM = product of the two numbers

∴ HCF(90,225)  LCM(90,225) = product of (90,225)
∴ 15  LCM(90,,225) = 90  225
90 x 225 20250
∴ LCM(90,225)
LCM = = =1350
15 15
∴ LCM(90,225) = 1350

8) Find whether 8n can end with the digit 0 for any natural number.

Solution: The prime factors of 8 are 2.Therefore the prime factors of 8n will also be 2.
Any digit ending with 0 must have 5 as one of its prime factors.
But the prime factors of 8 are 2.
Therefore 8n cannot end with 0.
 REAL NUMBERS

THE FUNDAMENTAL THEOREM OF ARITHEMATICS

9) Find the HCF and LCM of the following numbers using prime factorisation method
a) 9, 27 and 108 b) 16, 56 and 144

Solution:
a) 9, 27 and 108

Factors of the numbers are

9=3x3
27 = 3 x 3 x 3
108 = 2 x 2 x 3 x 3 x 3
HCF(9,27,108)=3 x 3=9
LCM(9,27,108)=2 x 2 x 3 x 3 x 3= 108
∴ HCF=9 & LCM=108

b) 16, 56 and 144

Factors of the numbers are

16 = 2 x 2 x 2 x 2
56 = 2 x 2 x 2 x 7
144 = 2 x 2 x 2 x 2 x 3 x 3
∴ HCF (16,56,144)=2 x 2 x 2=8
∴ LCM (16,56,144)=2 x 2 x 2 x 2 x 3 x 3 x 7=1008
∴ HCF = 8 & LCM = 1008

10) Prove that 16, 343 and 225 are relatively prime.

Solution:
Factors of the numbers
16 =2 x 2 x 2 x 2
343 = 7 x 7 x 7
225 = 3 x 3 x 5 x 5
∴ HCF(16,343,225)=1
That is they do not have any common factors
∴ They are relatively prime.
 REAL NUMBERS

IRRATIONAL NUMBERS
11) Prove that 7 is irrational.

a
Solution: Let 7 be rational. ∴ There exists integers a, b such that 7= b b≠0)
where a and b(
b
are co-prime.
∴ 7b = a
Squaring both sides we get,
7b 2 = a 2 Therefore a 2 is divisible by 7. Hence a is also divisible by 7.
∴ There exists an integer c such that a = 7c ∴ 7b 2 = (7c) 2
7b 2 = 49c 2 and hence b 2 = 7c 2 which means b 2 is divisible by 7 and b is also divisible by 7
Therefore a and b have a common factor 7. This is a contradiction, since a and b are co co-prime.
Hence our assumption 7 is rational is wrong.
Therefore 7 is irrational

12) Prove that 6 - 5 is irrational

b b ≠ 0 ) such
Solution: Let us assume that 6 − 5 is rational. Therefore there exists integers a and b(
a
that 6 − 5 = where a and b are co-prime.
co
b
a
Rearranging the equation we get 6 − = 5
b
a
Since a and b are integers also b0, 6 − is rational. Therefore 5 is rational
b
But this contradicts the fact that 5 is irrational.
Therefore our assumption that 6 − 5 is rational is wrong.
Therefore 6 − 5 is irrational

3
13) Prove that 4 is irrational.
3 3 a
Solution: Let us assume that 4 is rational. Therefore there exists integers a and b( b ≠ 0 ) such that 4=
b
a3
prime Taking cubes on both sides we get,t 4 =
where a and b are co-prime
b3
i.e. a 3 = 4b 3 . Therefore a 3 is divisible by 4 Hence a is also divisible by 4
Therefore there exists an integer c such that a=4c. ∴ 4b3 = (4c)3 = 64c3
∴ b 3 = 16c 3 Hence b 3 is divisible by 4 and hence b is divisible by 4.
Thereforee a and b have a common factor 4. 4. This is a contradiction, since a and b are co-prime
co
3
Therefore 4 is irrational
 REAL NUMBERS

IRRATIONAL NUMBERS
2
14) Prove that ( 2 +2 ) is irrational.
2
Solution: Let us assume that ( 2 +2 ) is rational. Hence there exists integers a and b( b ≠ 0 )
a 2
such that ( 2+2
b
) =
where a and b are co-prime.
co

a 1a 
Rearranging we get 2 + 4 2 + 4 = 6 + 4 2 = So 2 =  − 6  .
b 4b 
1a 
Since a and b are integers & b0,  − 6  is rational. Therefore 2 is rational.
4 b 
But this contradicts the fact that 2 is irrational.
2
Therefore our assumption that ( 2 +2 ) is rational was wrong.
2
Therefore ( 2+2 ) is irrational

15) Prove that 2 + 3 is irrational.

a
Solution: Let us assume 2 + 3 is rational. Hence there exists integers a and b( b ≠ 0 ) such that 2 + 3 =
b
where a and b are co-prime.
prime.
a
Rearranging we get 3 = − 2
b
a
Since 2 ,a and b are integers & b0, − 2 is rational.
b
Hence 3 is rational.
But this contradicts the fact that 3 is irrational.
Hence our assumption that 2 + 3 is rational was wrong
Therefore 2 + 3 is irrational
 REAL NUMBERS
RATIONAL NUMBERS

29
16) Without performing long division State whether will have a terminating decimal expansion or
16
a non-terminating repeating decimal expansion.
29 29 
Solution: can be written as 4 =   Thus the denominator is of the form 2 n 5m where n=4 and m=0.
16 2  
29
Therefore will have a terminating decimal expansion.
16

17) Comment on a) 0.1875 and b) 36.3675 with respect to their denominators.

Solution:
a) 0.1875
1875 3x54
0.1875 = =
10000 2 454
Thus we can say that the denominator is of the type 2 n 5m
b) 36.3675
363675 14547x52
36.3675 = =
10000 2 4 54
Thus we can say that the denominator is of the type 2 n 5m

64
18) Without performing long division State whether will have a terminating decimal expansion or
300
a non-terminating
terminating repeating decimal expansion.
Solution:
64 64
can be written as .
300 3x2252
Thus we can see here the denominator is not of the form 2 n 5m .
64
Therefore will be a non-terminating
terminating repeating decimal expansion.
300
 REAL NUMBERS

HOTS

19) If ab is irrational then prove that a + b is irrational.

Solution;
p
Let a + b be rational. Therefore there exists p and q( q ≠ 0 ) such that a+ b=
q
where p and q are co-prime.
2
 p
2
(
∴ a + b = ) q
Expanding we get,
2
 p
a + 2 ab + b =  
q
1  p  
2

ab =    − a − b 
2  q  
 
Since p, q, a and b are integers and q0.
1  p  
2

Hence    − a − b  is rational.
2  q  
 
Therefore ab is rational. But this contradicts the given fact that ab is irrational.
Hence our assumption that a + b is rational is wrong.
Therefore a + b is irrational.

20) Show that any positiveve odd integer is of the form 4q+1
4q or 4q+3 where q is some integer.
Solution:
Let x be any positive odd integer.
By Euclid’s division lemmama it can be written in the form x=bq+r where 0 ≤ r < b .
Take b=4 ∴ r can have values 0,1,2 or 3.
Thus x can be 4q+0,
q+0, 4q+1,4q+2 or 4q+3.
Since x is odd it cannot be equal to 4q or 4q+2.
Thus x can only be of the form 4q+1 or 44q+3