find the greates number which divides 6168,2447 and 3118 leaving the same reminder in each case?
Since the remainders are same in each division, the difference of numbers will be exactly divisible by the 'greatest number'
so, the required 'greatest divisor' wud be : \(gcf(6168-2447, 6118-3118, 3118-2447)\)
dear sometime we only leave reminder and take GCF....wy in this case we a r taking diff
good question :) in those cases where u directly take gcf, you're trying to find gcf of given numbers. but in the present problem, you're trying to find 'gcf of difference of numbers'
below two phrases are same :- 1) gcf of difference of given set of numbers 2) greatest number that leaves the same remainder when it divides the given of set numbers
why they both are same ?
lets dive in further
like in this case we only take GCF after leaving reminder find the greatest number which divides 742 and 1162 leaving 7 as reminder in each case?
taking gcf gives u the 'greatest number that leaves 0 as remainder'
why we take diff in 3 numbers?
before we address that, lets finish ur leaving 7 as remainder problem :)
find the greatest number which divides 742 and 1162 leaving 7 as reminder in each case? you seem to be knowing how to work this problem... may i knw how u solve this ?
occording question i leave 7 in each number and than GCF
you mean, u take \(gcf(742-7, 1162-7)\) ?
yes
gcf(735, 1155) 105
and u claim that, 742/105 and 1162/105 leave the remainder 7
which is correct !
may i knw why this works ?
yes correct
dnt know
okay, there is a standard way for working these problems
if you're not formula oriented, you will like the standard way
ok
find the greatest number which divides 742 and 1162 leaving 7 as reminder in each case? say, the required 'greatest number is \(n\)'
since when \(n\) divides 742, it leaves a remainder 7 :- 742 = \(n\)k + 7 742 - 7 = \(n\)k
ok
similarly, since when \(n\) divides 1162, it leaves a remaidner 7 :- 1162 = \(nq + 7\) 1162-7 = \(nq\)
ok
from both above, 742-7 and 1162-7 are divisible by \(n\) (why ?)
yes these are divisible
so, taking the \(gcf(742-7, 1162-7)\) gives u the 'largest number' that leaves remainder 7
see if that seems convincing :)
now i understand
good, see if u can explain why we're taking the differences now (our original problem)
u may use similar reasoning to make sense of it
find the greates number which divides 6168,2447 and 3118 leaving the same reminder in each case?
right
when our 'greatest number', say \(n\) divides the given numbers, say, it leaves a remainder \(R\) :- 6168 = \(n\)p + \(R\) 2447= \(n\)q + \(R\) 3118= \(n\)r + \(R\)
clearly, when u subtract any two equations above, \(R\) cancels out, and the difference is divisible by \(n\)
So, the required 'greatest number' is simple the gcf of difference of given numbers
thanks Dear
np :)
Join our real-time social learning platform and learn together with your friends!