Question

Use Euclid's Division algorithm to find the HCF of: 135 and 225​

Answer 1

Step-by-step explanation:

Given :-

135 and 225

To find :-

Use Euclid's Division algorithm to find the HCF of 135 and 225 ?

Solution:-

Given numbers are 135 and 225

We know that

Euclid's Division Lemma:-

For any two positive integers a and b there exist two positive integers q and r satisfying a = bq+r, 0≤r<b.

We have ,

a = 225

b = 135

On writing a as bq+r then

225 = 135 × 1 + 90

Now, take a = 135 and b = 90

Again , on writing a = bq+r

=> 135 = 90×1 + 45

Now, take a = 90 and b = 45

Again , on writing a = bq+r

=> 90 = 45×2+0

HCF (225,135) = 45

Answer:-

The HCF of two numbers 135 and 225 is 45

Used formulae:-

Euclid's Division Lemma:-

For any two positive integers a and b there exist two positive integers q and r satisfying a = bq+r, 0≤r<b.

Answer 2

....hope it helps you ...