Worked solution: -7 mod 3
Step-by-step working for this modular arithmetic problem, produced and checked by the solver.
Modular arithmetic Answer checked
Answer
- Divide and find the remainderThe remainder is always between 0 and 2, even for negative numbers.
- Check: rebuild the number
Change the numbers and solve your own
The method in brief
- a mod n: divide and keep the remainder. Negative numbers still give a result from 0 to n - 1.
- For big powers, square repeatedly and reduce mod n at every step.
- The inverse of a mod n exists only when gcd(a, n) = 1. Find it with the extended Euclidean algorithm.
- Solve ax ≡ b (mod n): there are solutions only if gcd(a, n) divides b.
Full guide: Mod, powers mod n, inverses and congruences.