Worked solution: solve 6x = 4 mod 10

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

Modular arithmetic Answer checked
Answer
x≡4(mod5)  (2 solutions mod 10:4,9)x \equiv 4 \pmod{5}\ \ (2\text{ solutions mod } 10: 4, 9)
  1. The congruence
  2. gcd test
    The gcd divides 4, so there are 2 solutions mod 10.
  3. Check: substitute each solution

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