Question

Use Euclid's division algorithm to find HC of 135 and 2​

Answer 1

Answer:

HCF of 135 and 2 using Euclid division algorithm

135=2×67+1

2=1×2+0

Therefore 1 is the HCF of 135 and 2

Answer 2

Step-by-step explanation:

STEP 1 :-

since 135>2,we divide 135 by 2 to get 67as a quotient and 1 as remainder.

so by Euclid's division lemma, we get

135=67×2+1.

STEP 2 :-

since the remainder 1 is not equal to 0(zero).

so, we divide 2 by 1 to get 2 as quotient and 0(zero) as remainder.

Therefore by Euclid's division lemma,

we get

2=1×2+0.

The remainder has now becomes 0, so our procedure stops.

hence. HCF (135, 2)=1.