Question

Find the greatest mo. Mwhich
on due dirig 1656 & 2043 leaves
remainder 6 in each case .​

Answer 1

the greatest number which divides (1656-6) and (2043-6) leaving a remainder 6 in each case is the HCF of 1650 and 2037

using Euclid's Division Algorithm

a=bq+r

2037=1650×1+387

1650=387×4+102

387=102×3+81

102=81×1+21

81=21×3+18

21=18×1+3

18=3×6+0

therefore, the greatest number which divides 1656 and 2043 leaving a remainder 6 in each case is 3.

Answer 2

Answer:

The greatest number which divides (1656-6) and (2043-6) living a remainder 6 in each case is the HCF of 1656 and 2043.

Using Euclid's Division Algorithm

a=bq+r

2037=1650×1+387

1650=387×4+102

387=102×3+81

102=81×1+21

81=21×3+18

21=18×1+3

18=3×6+0

Hence,the greatest number which divides 2043 and 1656 leaving a remainder of 6 in each case is 3....

Hope it helps!

please mark me as brainilest ♥️

Please follow me permanently and take 10 thanks in return