Question

use Euclid's division algorithm to find the HCF of (i) 135 and 225​

Answer 1

Answer:

Use 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

Step-by-step explanation:

225=(135×p)+q.

⇒225=(135×1)+90.

⇒135=(90×1)+45.

⇒90=(45×2)+0.

∴HCF(135,225)=45.