When only the remainder matters, you never need the full number. Replace each number by its remainder, add, subtract or multiply the remainders, and reduce again; for large powers, find the cycle of remainders.
| Step | On | |
|---|---|---|
| 1 | Reduce each number modulo n. Divide by and keep the remainder (how to compute a remainder). For , the digit sum gives it quickly. | , , |
| 2 | Do the operations on the remainders. Follow the usual order of operations. | |
| 3 | Reduce the result. The final answer must lie between and . | |
| 4 | Check with the full numbers, if they are small. Both routes give the same remainder. |