Use euclids division algorithm to find the hcf of 210,108 and 63.
Answers
Answered by
2
By Euclid's Division algorithm 210 and 108
For every point of integers a and b there exist unique integer q and r such that a = bq + r, where 0 ≤ r < b .
Here, a=210, b=108
then,
210=108×1+102
108=102×1+6
102=6×17+0
Here r=0.
∴, H.C.F of 210 and 108 is 6.
Now we find the H.C.F of a=63 and b=6.
63=6×10+3
6=3×2+0
Here r=0.
∴, H.C.F of 63 and 6 is 3
∴, H.C.F of 210,108 and 63 is 3.
For every point of integers a and b there exist unique integer q and r such that a = bq + r, where 0 ≤ r < b .
Here, a=210, b=108
then,
210=108×1+102
108=102×1+6
102=6×17+0
Here r=0.
∴, H.C.F of 210 and 108 is 6.
Now we find the H.C.F of a=63 and b=6.
63=6×10+3
6=3×2+0
Here r=0.
∴, H.C.F of 63 and 6 is 3
∴, H.C.F of 210,108 and 63 is 3.
Similar questions