using euclid's division algorithm find HCF of following question a 1288, 576
Attachments:
Answers
Answered by
5
using Euclid's division algorithm for 1288,576 :
here, 1288>576
1288=576×2+136
576=136×4+32
136=32×4+8
32=8×4+0
The remainder has now become 0.
∴, the H.C.F of 1288,576 is 8.
here, 1288>576
1288=576×2+136
576=136×4+32
136=32×4+8
32=8×4+0
The remainder has now become 0.
∴, the H.C.F of 1288,576 is 8.
Similar questions