(c) 7335+1222. Find the least numberunnce exactly.at should be subtrac

1.	(c) 7335+1222. Find the least numberunnce exactly.at should be subtracted from 1000 so thatbe s
Answer» According to Euclid's division algorithm, a=bq+r Where, a= dividend b=divisor q=quotient And r=remainder. So let a=1000, b=35, So we get, 1000= 35×28+20 Subtracting 20 from both sides, 1000–20=35×28+20–20 Thus, 980=35×28 Therefore, as seen above,980 is perfectly divisible by 35. And so,20 is the smallest number to be subtracted.

(c) 7335+1222. Find the least numberunnce exactly.at should be subtracted from 1000 so thatbe s

Answer»

According to Euclid's division algorithm,

a=bq+r

Where,

a= dividend

b=divisor

q=quotient

And r=remainder.

So let a=1000, b=35,

So we get,

1000= 35×28+20

Subtracting 20 from both sides,

1000–20=35×28+20–20

Thus, 980=35×28

Therefore, as seen above,980 is perfectly divisible by 35.

And so,20 is the smallest number to be subtracted.