Worked solution: 7^200 mod 13

Step-by-step working for this modular arithmetic problem, produced and checked by the solver.

Modular arithmetic Answer checked
Answer
7200≡3(mod13)7^{200} \equiv 3 \pmod{13}
  1. Use repeated squaring, reducing mod 13 at every step
    Never work out the huge power first: reduce after each multiplication.
  2. Binary of the power
    Multiply in the squares that match each 1 bit.
  3. Result
  4. Check: multiply 200 times, reducing each time

Change the numbers and solve your own

The method in brief

  1. a mod n: divide and keep the remainder. Negative numbers still give a result from 0 to n - 1.
  2. For big powers, square repeatedly and reduce mod n at every step.
  3. The inverse of a mod n exists only when gcd(a, n) = 1. Find it with the extended Euclidean algorithm.
  4. Solve ax ≡ b (mod n): there are solutions only if gcd(a, n) divides b.

Full guide: Mod, powers mod n, inverses and congruences.

More Further maths examples on this topic