Use euclid's algorithm to find the hcf of 2527 and 1653, 1261 and 442, and 576 and 252.
Answers
Answered by
32
i)
Applying Euclid division algorithm to 2527 and 1653 ,we get
2527=1653×1+874
Applying Euclid division algorithm to 1653 and 874 ,we get
1653=874×1+779
Applying Euclid division algorithm to 874 and 779 we get
874=779×1+95
Applying Euclid division algorithm to 779 and 95 we get,
779=95×8+19
Applying Euclid division algorithm to 95 and 19 we get,
95=19×5+0
The remainder at this stage is zero.
Hence HCF = 19
ii)
1261 and 442
1261=442×2+377
442=377×1+65
377=65×5+52
65=52×1+13
52=13×4+0
The remainder at this stage is zero.
Hence HCF = 13
iii)
576 and 252
576=252×2+72
252=72×3+36
72=36×2+0
The remainder at this stage is zero.
Hence HCF = 36
Applying Euclid division algorithm to 2527 and 1653 ,we get
2527=1653×1+874
Applying Euclid division algorithm to 1653 and 874 ,we get
1653=874×1+779
Applying Euclid division algorithm to 874 and 779 we get
874=779×1+95
Applying Euclid division algorithm to 779 and 95 we get,
779=95×8+19
Applying Euclid division algorithm to 95 and 19 we get,
95=19×5+0
The remainder at this stage is zero.
Hence HCF = 19
ii)
1261 and 442
1261=442×2+377
442=377×1+65
377=65×5+52
65=52×1+13
52=13×4+0
The remainder at this stage is zero.
Hence HCF = 13
iii)
576 and 252
576=252×2+72
252=72×3+36
72=36×2+0
The remainder at this stage is zero.
Hence HCF = 36
Answered by
4
Answer:
Hope it helps you
Step-by-step explanation:
MARK ME AS BRAINLIEST
Attachments:
Similar questions