Question

use Euclid divisional Algorithm find H. C. F of 135 and 225​

Answer 1

Answer :

H.C.F of 135 and 225 is 45.

$\rule{100}2$

Here,

• 135 < 225

Euclid's  lemma :

• a = bq + r

Now,

• 225 = 135 × 1 + 90
• 135 = 90 × 1 + 45
• 90 = 45 × 2 + 0

Therefore,

45 is the H.C.F.

$\rule{200}2$

Answer 2

Answer:

a = 225

b = 135

by euclids division algorithm

a = bq + r

225 = 135 * 1 + 90

135 = 90 * 1 + 45

90 = 45 * 2 + 0

so, the HCF = 45 ans.