find the largest number that divides 2053 and 967 leaving remainder 5 and 7 respectively... find by euclids division algorithm
Answers
Answered by
4
The numbers are 2053 and 967
As they leave remainder 5 and 7
So in order to find the greatest common number which can divide bith we have to subtract 5 from 2053 and 7 from 967
New numbers are 2048 and 960
Now greatest number which can divide both is their HCF
By euclid division leumma
2048=960×2+128
960=128×7+64
128=64×2+0
So the greatest number is 64 which can divide 2053 and 967 leaving remainder 5 and 7
Hope it helps!! :)
As they leave remainder 5 and 7
So in order to find the greatest common number which can divide bith we have to subtract 5 from 2053 and 7 from 967
New numbers are 2048 and 960
Now greatest number which can divide both is their HCF
By euclid division leumma
2048=960×2+128
960=128×7+64
128=64×2+0
So the greatest number is 64 which can divide 2053 and 967 leaving remainder 5 and 7
Hope it helps!! :)
Similar questions