Question

what is the biggest remainder when you divide a number by 8

Answer 1

Answer:

Maximum possibility of Remainder = 7

Step-by-step explanation:

we according to Division Algorithms

If there are two integers a and b where b ≠ 0 and a > b then their exist two integer q (quotient) and r (reminder) such that

a = bq + r        where   r = 0 and r < b

So

If we have to divide any number c with 8 then

According to division algorithm

c = 8q + r  where r = 0 or r < 8

And so

the maximum possibility of r is 7

So

Maximum possibility of Remainder = 7