Find the greatest number that divides 220 and 313 leaving remainders 3
Answers
Answered by
0
This can be solved using Euclids division lemma.Hope the answer helps
Attachments:
Answered by
2
Hi mate your answer is....
First of all we subtract 3 from both number.
Then,
220-3=217
313-3=310
Then By using Euclid algorithm
217<310
310/217
310=217×1+93
217/93
217=93×2+31
93/31
93=31×3+0
Hence the HCF is 31
So, 31 is the greatest number that divides 220
and 313 and leave reminders 3
I hope it will help you....
⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐
First of all we subtract 3 from both number.
Then,
220-3=217
313-3=310
Then By using Euclid algorithm
217<310
310/217
310=217×1+93
217/93
217=93×2+31
93/31
93=31×3+0
Hence the HCF is 31
So, 31 is the greatest number that divides 220
and 313 and leave reminders 3
I hope it will help you....
⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐
rishi3962:
hii
i love u angel
Similar questions