Question

which least number should be subtracted from 1000 so that the difference is exactly divisible by 35 ?

Answer 1

Hi.... Friend...... Here is your 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.


Please mark me as brainliest