Question

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

Answer 1

$\huge \bold{question}$

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

$\huge \bold{answer}$

Apply Euclid's lemma .

$\tt \: c = dq + r \: \: \: \: \: 0 \leqslant r < d$

$\tt \: c = 225 \\ \tt \: d = 135$

$\tt \: 225 = 135 \times 1 + 90$

Remainder is not 0 , so we will continue.

$\tt \: 135 = 90 \times 1 + 45$

Remainder is again not 0. so what ? we will continue .

$\tt 90 = 45 \times 2 + 0$

Finally we got remainder as 0. And we got hcf of 125 and 225 as 45 .

$= > \tt \: hcf = 45$

Answer 2

Step-by-step explanation:

by euclid's division algorithm

225=135×1+90

135=90×1+45

90=45×2+0

hence the hcf is 45