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:
(6 ,-7)
Step-by-step explanation:
Answer: A. The first one
Step-by-step explanation:
