What is the HCF of 135 and 225 by Euclid's division algorithm.
Answers
Answered by
7
Hey mate, here is your answer -:)
__________________________
___________________________
HOPE it helps to you!!!
__________________________
___________________________
HOPE it helps to you!!!
aayush545:
Hii
Answered by
15
Here is your solution
According to Euclid's division algorithm.
a = bq+r
Where
a=dividend
b=Divisor
r=remainder
Now
a=bq+r
225=135×1+90
135=90×1+45
90=45×2+0
hence
HCF of 135 and 225 by Euclid's division algorithm. is 45
According to Euclid's division algorithm.
a = bq+r
Where
a=dividend
b=Divisor
r=remainder
Now
a=bq+r
225=135×1+90
135=90×1+45
90=45×2+0
hence
HCF of 135 and 225 by Euclid's division algorithm. is 45
Similar questions