Equation solution in modular arithmetic

39 Views Asked by At

Given two primes $11$ and $5$, find all $α > 1$ such that $α^{5} \equiv 1 \mod 11$.

How would you compute that?

1

There are 1 best solutions below

0
On

A small table will do: $$\begin{array}{r*{5}{c}} x &\pm2&\pm3&\pm4&\pm5\\ \hline x^2& 4&-2&5&3\\ x^4 &5&4&3&-2\\ x^5&\mp1&\pm1&\pm1&\pm1\\ \hline \end{array}$$ Hence the solutions are $$\alpha= 1,\;-2,\;3,\;4,\;5. $$