Sol. Let ‘a’ be any positive integer and b = 6.

Then, by Euclid’s division lemma there exists integers ’a’

and ‘r’ such that

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

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

[∴0 ≤ r < 6 ⇒ r = 0, 1,2,3,4,5]

⇒ a = 6q + 1 or, a = 6q + 3 or, a = 6q + 5.

[∴a is an odd integer, ∴ 6q, a Real Numbers 6q + 2, a ≠ 6q + 4]

Hence, any odd integer is of the form 6q + 1 or, 6q + 3 or, 6q + 5.

2. Use Euclid’s Division Lemma to show that the cube of any positive integer is of the form 9m, 9m +
1 or 9 m + 8, for some integer q.

Sol. Let x be any positive integer. Then, it is of the form 3q or, 3q + 1 or, 3 + 2.

Case - I When x = 3q

⇒ x3 = (3q)3 = 27q3 = 9(3q3) = 9m, where m = 9q3

Case - II when x = 3q + 1

⇒ x3 = (3q + 1)3

⇒ x3 = 2q3 + 27q2 + 9q + 1

⇒ x3 = 9q (3q2 + 3q + 1) + 1
⇒ x3 = 9m + 1, where m = q (3q2 + 3q + 1).

Case - III when x = 3q + 2

⇒ x3 = (3q + 2)3

⇒ x3 = 27q3 + 54q2 + 36q + 8

⇒ x3 = 9q(3q2 + 6q + 4) + 8

⇒ x3 = 9m + 8, where m = 3q2 + 6q + 4)

Hence, x3 is either of the form 9m of 9m + 1 or 9m + 8.

3. Use Euclid’s Division Algorithm to show that the square of any positive integer is either of the
form 3m or 3m + 1 for some integer m.

Sol. Let x be any positive integer

Taking a = x and b = 3. So x may be either

Real Numbers for Real Numbers [by division algorithm]

⇒ Real Numbers [taking Real Numbers]

⇒ Real Numbers [taking Real Numbers]

also Real Numbers

[taking Real Numbers]

Thus, we see that x2 may be of the form either 3 m or 3m + 1 for some integer m.

EUCLID’S DIVISION ALGORITHM:

If ‘a’ and ‘b’ are positive integers such that a = bq + r, then every common divisor of ‘a’ and ‘b’ is a
common divisor of ‘b’ and ‘r’ and vice-versa.

To obtain the HCF of two positive integers, say c and d, with c > d, follow the steps below:

Step 1: Apply Euclid's division lemma, to c and d. So, we find whole numbers, q and r such that c = dq
+ r, 0 ≤ r < d.

Step 2 : If r = 0, d is the HCF of c and d. If r ≠ 0. If r ≠ 0, apply the division lemma to d and r.

Step 3 : Write d = er + r1 where 0 < r-1 < r

Step 4 : Continue the process till the remainder is zero. The divisor at this stage will be the required
HCF.

To find HCF of 575 and 15. Let us use Euclid’s algorithm

575 = 15 × 38 + 5

Now, consider 15 and 5 and applying Euclid’s algorithm again.

15 = 5 × 3 + 0

Here, the remainder is zero.

∴ HCF of 15 and 5 is 5.

∴ HCF of 575 and 15 is also 5.

1. Find the HCF of 128, 240 using Euclid’s Division Algorithm.

Sol. 240 = 128 × 1 + 112

128 = 112 × 1 + 16

112 = 16 × 7 + 0 → Remainder is zero.

HCF of 112 and 16 is 16.

HCF of 240 and 128 is 16.

2. What is the largest number that divides 626, 3127 and 15628 and leaves remainders of 1, 2 and 3
respectively.

Sol. Clearly, the required number is the H.C.F. of the number 626 - 1 = 625, 3127 - 2 3125 and 15628
– 3 = 15625.

15628 – 3 = 15625.

Using Euclid’s division lemma to find the H.C.F. of 625 and 3125.

3125 = 625 × 5 + 0

Clearly, H.C.F. of 625 and 3125 is 625.

Now, H.C.F. of 625 and 15625

15625 = 625 × 25 + 0

So, the H.C.F. of 625 and 15625 is 625.

Hence, H.C.F. of 625, 3125 and 15625 is 625.

Hence, the required number is 625.

3. Show that only one of the numbers (n + 2), n and (n + 4) is divisible by 3.

Sol. Let n be any positive integer.

On dividing n by 3, let q be the quotient and r be the remainder.

Then, by Euclid’s division lemma, we have

n = 3q + r where 0 ≤ r < 3

⇒ n = 3q + r where r = 0,1 or 2

⇒ n = 3q (where r = 0), n = 3q +1 (when r = 1

and n = 3q +2 (when r = 2)

The following table shows the divisibility of n, n + 2 and n + 4 by 3.

Case 1:

Positive

integer (n)

n+2

n+4
When n = 3q

3q

(3q) + 2

(3q) + 4

= 3(q + 1) + 1

Division by 3