The quotient remainder theorem: Given any integer A, and a positive integer B, there exist unique integers Q and R such that
A= B · Q + R where 0 ≤ R < B.
Q is called quotient and R is called remainder.
According to this theorem, when you divide any number by 41, you can obtain remainder R such that 0 ≤ R < 41. Then the greatest possible whole number remainder is 40.
Answer:
-0.825
Step-by-step explanation:
Did not know the options so do not know if this is right or not.
It has to be 2800 hope it right
Answer:
1 11/38
Step-by-step explanation:
7 divided by 5 3/7 and you get 49/38 simplify by divided the the top by the bottom and you should get 1 11/38
Answer:
13.7113092008
Step-by-step explanation:
hope this helps
