Question

use Euclid's division Algorithm to find the HCF of : (1) 135 And 225

Answer 1

here see this is your example

consider positive integers 418 and 33.
Step-1
Taking bigger number (418) as a and smaller number (33) as b
express the numbers as a = bq + r
⇒ 418 = 33 × 12 + 22
Step-2
Now taking the divisor 33 and remainder 22; apply the Euclid’s division algorithm to get:
33 = 22 × 1 + 11 [Expressing as a = bq + r]
Step-3
Again with new divisor 22 and new remainder 11; apply the Euclid’s division algorithm to get:
22 = 11 × 2 + 0
Step-4
Since, the remainder = 0 so we cannot proceed further.
Step-5
The last divisor is 11 and we say H.C.F. of 418 and 33 = 11.


and the h cf of your question is 45

Answer 2

HEY FRIEND
u'rr answer is 45