Math, asked by bp2019laptop, 4 months ago

solve this problem by EUCLID'S DIVISION ALGORITHM​

Attachments:

Answers

Answered by mdmsiwan
1

Answer:

smallest no divided longer no

135 ÷225 =45 is your answer

Step-by-step explanation:

hope it helps you

Answered by nishtha002
0

Step-by-step explanation:

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.

Similar questions