Find the largest number which leaves the same remainder when it divides 444, 804 and 1344.
150
180
160
140
Answers
Answer:
Assume that ‘d’ is the largest divisor , which divides 62,132,& 237 leaving remainder ‘ r' in each case.
By Euclid's division lemma, we state that
a= d*q + r , where 0 < r < d
dividend = divisor * quotient + remainder
62 = d * q1 + r
132 = d * q2 + r
237 = d * q3 + r
OR
62 -r = d *q1
132 -r = d * q2
237 -r = d* q3
This concludes that (62-r), (132-r) & (237-r) are exactly divisible by d as remainder now = 0. Or we can say that d is gcd of all these three numbers .
As we know that , if d divides a & b. Then d divides (a- b) too
So, d divides (132-r) - (62-r)
=> d divides 132 -r -62 +r
=> d divides 70 ………..(1)
Similarly d divides (237 - r) - (62 -r)
=> d divides 237 -r -62 +r
=> d divides 175 ……….(2)
=> By (1) & (2)
d is gcd of 70 & 175
70 = 2*5*7
175 = 5*5*7
So, gcd = 5*7 = 35
ANS: largest divisor is 35
Step-by-step explanation:
its halp you
Answer:Largest number which leaves the same remainder when it divides 444, 804 and 1344 is 180
Step-by-step explanation:
Since the remainders are the same the difference of every pair of given numbers would be exactly divisible by
the required number
804-444=360 1344-804=540 1344-444=900
∴ Required number = HCF of 360,540 and 900.
HCF of 360,540 and 900 is
Hence, largest number which leaves the same remainder when it divides 444, 804 and 1344 is 180
#SPJ2