Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

While learning about the Legendre symbol I came across this fact:

If $x^ 4 \equiv -1 \mod p$ then $p \equiv 1 \mod 8$.

Provided '$p$' is a prime greater than $2$.

I could not prove it. Can someone help me to prove the same?


share|cite|improve this question
$p$ is a prime.? – Inceptio Mar 18 '13 at 8:07
I guess so..... – i707107 Mar 18 '13 at 8:09
It is a prime. Else the $p\equiv 2 / 1 \mod 8$ – Inceptio Mar 18 '13 at 8:09
$p$ prime must be given as assumption. Since $3^4 \equiv -1 \textrm{ mod} 82$, and 82 is not a prime. – i707107 Mar 18 '13 at 8:17
You need to specify that $p$ is odd. Note that $1^4 \equiv -1 \pmod{2}$. – Ivan Loh Mar 18 '13 at 9:07

Let $p$ be a prime. Suppose that $x^4+1\equiv 0 \textrm{ mod }p$ is solvable.

Then $x$ has order 8 in the multiplicative group of $\mathbb{F}_p$.

Since an order of subgroup must divide the group order, and the cyclic group generated by $x$ has order $8$, we have $8\mid p-1$.

share|cite|improve this answer
And since the multiplicative group of $\Bbb F_p$ is itself always cyclic, one has $x^4\equiv1\pmod p$ solvable for an odd prime $p$ if and only if $p\equiv1\pmod8$. (But of course that was not the question.) – Marc van Leeuwen Mar 18 '13 at 8:31

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.