Find the HCF by euclid division algorithm 92690,7378,7161 ?
Answers
Answered by
611
By Euclid’s division algorithm,
92690 = 7378 x 12 + 4154
7378 = 4154 x 1+ 3224
4154 = 3224 x 1 + 930
3224 = 930 x 3 + 434
930 = 434 x 2 + 62
434 = 62 x 7 + 0
Therefore, HCF (92690, 7378) = 62
7161 = 62 x 115 + 31
62 = 31 x 2 + 0
Therefore, HCF(7161, 62) = 31
Hence, HCF (92690, 7378, 7161) = 31
92690 = 7378 x 12 + 4154
7378 = 4154 x 1+ 3224
4154 = 3224 x 1 + 930
3224 = 930 x 3 + 434
930 = 434 x 2 + 62
434 = 62 x 7 + 0
Therefore, HCF (92690, 7378) = 62
7161 = 62 x 115 + 31
62 = 31 x 2 + 0
Therefore, HCF(7161, 62) = 31
Hence, HCF (92690, 7378, 7161) = 31
Answered by
161
➖➖➖➖➖➖➖➖➖➖➖➖➖
➖➖➖➖➖➖➖➖➖➖➖➖➖
➖➖➖here's your answer➖➖➖
➖➖➖➖➖➖➖➖➖➖➖➖➖
➖➖➖➖➖➖➖➖➖➖➖➖➖
✌✌
Attachments:
Similar questions