Find the largest positive integer that divides 125,162 and 259 leaving remainder 5,6and 7 respectively
Answers
Answered by
3
On dividing 398 by the required number, there is a remainder of 7. This means that 398 7 = 391 is exactly divisible by the required number. Similarly, 436 -11 = 425 and 542 15 = 527 are exactly divisible by the required number.
The HCF of two positive integers is the largest positive integer that divides both the integers.
So, the required number will be the HCF of 391, 425 and 527. And that can be found by using Euclids division algorithm.
425 = 391 x 1 + 34
391 = 34 x 11 + 17
34 = 17 x 2 + 0
Thus, HCF = 17
Hence, the required number is 17.
.
.
The HCF of two positive integers is the largest positive integer that divides both the integers.
So, the required number will be the HCF of 391, 425 and 527. And that can be found by using Euclids division algorithm.
425 = 391 x 1 + 34
391 = 34 x 11 + 17
34 = 17 x 2 + 0
Thus, HCF = 17
Hence, the required number is 17.
.
.
Neelamkerketta191:
Thank you very much
Where do you live because I want a tuition from you
I'm from pune
N I can't take ur tutions bcz I m in 9th std....
Can you explain more
And I have a question
You write that dividing 398 i can't see that in question where is the 398 no.in question
Similar questions