Class 10 Maths

# Real Number

## Theorem (Euclid’s Division Lemma):

For a pair of given positive integers ‘a’ and ‘b’, there exist unique integers ‘q’ and ‘r’ such that

a=bq+r, where 0≤r<b

Explanation:

Thus, for any pair of two positive integers a and b; the relation

a=bq+r, where 0≤r<b

will be true where q is some integer.

Example:

(a) 20, 8

Let 20 = a and 8 = b

Therefore, by applying the relation a=bq+r, where 0≤r<b we get 20=8xx2+4 (In this q=2 and r=4)

(b) 17, 5

Let 17 = a and 5 = b

Therefore, by applying the relation a=bq+r, where 0≤r<b we get 17=5xx3+2 (In this q=3 and r=2

### Exercise 1.1(NCERT Book)

Question - 1: Use Euclid’s division algorithm to find the HCF of:

(i) 135 and 225 (ii) 196 and 38220 (iii) 867 and 255

In the given problem, let 225 = a, and 135 = b

Therefore, by applying the relation a=bq+r, where 0≤r<b we get

225=135xx1+90 (Here r=90)

Since, r (remainder) is not equal to zero (0). Thus, by applying the Euclid’s division algorithm, by taking 135 = a, and 90 = b we get

135=90xx2+45 (Here r=45)

Since, in this step also, r is not equal to zero(0). Thus by continuing the Euclid’s division algorithm, by taking this time, 90 = a, and 45 = b we get

90=45xx2+0 (In this step we get r=0)

Therefore, 45 is the HCF of given pair 225 and 135

In the given pair, 38220 > 196, thus let 38220 = a and 196 = b

Now by applying the Euclid’s division algorithm, we get

38220=196xx195+0 (Here q=195 and r=0)

Since, in the above equation we get, r = 0, therefore, 196 is the HCF of the given pair 196 and 38220.

(iii) 867 and 255

Answer: Let a = 867 and b = 255, thus after applying the Euclid’s division algorithm we get

867 = 255 xx 3 + 102 ( Where r = 102)

Since, r ≠ 0, therefore, by taking 255 and 102 as a and b respectively we get

255 = 102 xx 2 + 51

Similarly, 102 = 51 xx 2 + 0 (Where, r = 0)

Since, in this term r = 0, thus HCF of the given pair 867 and 255 is equal to 51

Question - 2 – Show that any positive odd integer is of the form 6q + 1 or, 6q +3 or, 6q + 5, where q is some integer.

Answer: Let ‘a’ be any positive odd integer and ‘b = 6’.

Therefore,

a=6q+r where 0≤r<6

Now, by placing r = 0, we get, a = 6q + 0 = 6q

By placing r = 1, we get, a = 6q +1

By placing, r = 2, we get, a = 6q + 2

By placing, r = 3, we get, a = 6q + 3

By placing, r = 4, we get, a = 6q + 4

By placing, r = 5, we get, a = 6q +5

Thus, a = 6q or, 6q +1 or, 6q + 2 or, 6q + 3 or, 6q + 4 or, 6q +5

But here, 6q, 6q + 2, 6q +4 are the even integers

Therefore, 6q + 1 or, 6q + 3 or, 6q + 5 are the forms of any positive odd integers.

Alternate Method: Assume any value for q; like 1, 2, 3, ………….n

If q = 1;

Then;

6q+1=6xx1+1=7

If q = 2; Then;

6q+1=6xx2+1=13
6q+3=6xx2+3=15
6q+5=6xx2+5=17

Similarly, we can go on substitiuting different values for q and the result would always be a positive odd integer.

Another rationale for this can be as follows:

Since 6 is an even number and product of any number with an even number is always an even number. Moreover, if an odd number is added to any even number, we get an odd number as result.

Question 3: An army contingent of 616 members is to march behind an army band of 32 members in a parade. The two groups are to march in the same number of columns. What is the maximum number of columns in which they can march?

Answer: The required number of column is obtained by the HCF of 616 and 32

Let, a = 616 and b = 32, therefore, by applying Euclid’s division algorithm, we get

616 = 32 xx 19 + 8, since, here r = 8 and p≠0, thus, by continuing the process, we get

32 = 8 xx 2 + 0, here r = 0

Thus, the HCF of 616 and 32 is equal to 8

Thus, the required maximum number of column = 8

Question 4: 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.

[Hint: Let x be any positive integer then it is of the form 3q, 3q +1 or 3q + 2. Now square each of these and show that they can rewritten in the form 3m or 3m +1]

Answer: Let ‘n’ is any positive integer, then it is of the form of 3q or, 3q + 1 or, 3q + 2

If, n=3q

By squaring both sides we get
n^2=(3q)^2=9q^2=3(3q^2)
Or, n^2=3m, where m=3q^2

By squaring both sides we get
n^2=(3q+1)^2
=9q^2+6q+1
=3(3q^2+2q)+1
Or, n^2=3m+1
Where m=(3q^2+2q)

If, n =3q+2

Then b squaring both sides we get
n^2=(3q+2)^2
=9q^2+12q+4
=9q^2+12q+3+1
=3(q^2+4q+1)+1
Or, n^2=3m+1
Where, m=q^2+4q+1

Therefore, square of any positive integer is either of the form of 3m or 3m + 1

Alternate method:

4=3xx1+1, i.e. 3m+1

Let us take the next square number, i.e. 9

9=3xx3, i.e. 3m

Let us take the next square number, i.e. 16

16=3xx5+1, i.e. 3m+1

Therefore, square of any positive integer is either of the form of 3m or 3m + 1

Question 5: Use Euclid’s division lemma to show that the cube of any positive integer is of the form 9m, 9m + 1 or 9m + 8.

Answer: Let ‘a’ is a positive integer and b = 4

Therefore, according Euclid’s division lemma

a=3q+r, where 0≤r&let;4

Therefore, if r=0 then
a=3q
Or, a^3=(3q)^3=27q^3
Or, a^3=9(3q^3)
Or, a^3=9m, where m=3q^3

If r=1 then
a=3q+1
Or, a^3=(3q+1)^3=27q^3+1+27q^2+9q
(Since (a+b)^3=a^3+b^3+3a^2b+3ab^2)
Or, a^3=27q^3+27q^2+9q+1
Or, a^3=9(3q^3+3q^2+q)+1
Or, a^3=9m+1, where m=3q^3+3q^2+q

If r=2 then
a=3q+2
Or, a^3=(3q+2)^3
Or, a^3=27q^3+54q^2+36q+8
Or, a^3=9(3q^3+6q^2+4q)+8)
Or, a^3=9m, where m=3q^3+6q^2+4q

If r=3 then
a=3q+3
Or, a^3=(3q+3)^3
Or, a^3=27q^3+81q^2+81q+27
Or, a^3=9(3q^3+9q^2+9q+3)
Or, a^3=9m, where m=3q^3+9q^2+9q+3

Thus, cube of any positive integer is in the form of 9m, 9m +1 or 9m +8

Alternate method:

8=9xx0, i.e. 9m+8
27=9xx3, i.e. 9m
64=9xx7+1, i.e. 9m+1
Thus, cube of any positive integer is in the form of 9m, 9m +1 or 9m +8`