Question

Find HCF By
Euclid's Division Algorithm
HCF (135, 225) = ?​

Answer 1

Answer:

Step-by-step explanation:

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

225=(135×p)+q.

⇒225=(135×1)+90.

⇒135=(90×1)+45.

⇒90=(45×2)+0.

∴HCF(135,225)=45.

Answer 2

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

1. 225=(135×p)+q.
2. ⇒225=(135×1)+90.
3. ⇒135=(90×1)+45.
4. ⇒90=(45×2)+0.
5. ∴HCF(135,225)=45.