Quotient & Remainder
When you divide an integer N by a positive divisor d, you get a quotient q and a remainder r that obey N = d·q + r, where 0 ≤ r < d. The remainder is never negative and never as large as the divisor — dividing by 5 can only leave 0, 1, 2, 3 or 4. The GRE calculator gives a decimal, not a remainder, so you convert: 47 ÷ 5 = 9.4 means the whole-number quotient is 9, and the remainder is 47 − 5×9 = 2. Reading it the other way is just as useful: "a number that leaves remainder 3 when divided by 7" is any number of the form 7k + 3 (3, 10, 17, 24, …). Being fluent in both directions — from a number to its remainder, and from a remainder to the family of numbers — is what these problems test.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Division & remainders
| Division identity | N = d·q + r, 0 ≤ r < d |
|---|---|
| Remainder range | 0 to (divisor − 1) |
| Remainder of a sum | (r₁ + r₂) mod d |
| Remainder of a product | (r₁ × r₂) mod d |
Units-digit cycles
| Cycle of 2 | 2, 4, 8, 6 (length 4) |
|---|---|
| Cycle of 3 | 3, 9, 7, 1 (length 4) |
| Cycle of 7 | 7, 9, 3, 1 (length 4) |
| Cycle of 8 | 8, 4, 2, 6 (length 4) |
| Stable digits | 0,1,5,6 repeat unchanged |