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

I have quite a problem, two methods, different results. something's wrong.

I'm trying to find under what conditions the Legendre symbol for $(\frac{3}{p})(\frac{-1}{p})=1$.

First Way: $(\frac{3}{p})(\frac{-1}{p})=(\frac{3}{p})\cdot(-1)^{(p-1)/2}$. For $p\equiv1\pmod4$, I get that $(\frac{3}{p})=(\frac{p}{3})$ and it is $1$ iff $p\equiv1\pmod3$ and $p\equiv1\pmod4$. Otherwise I get that $(\frac{3}{p})=-(\frac{p}{3})$ so it has to be that $p\equiv1\pmod3$, in order to get $-1\cdot -1 \cdot 1=1$. The Chinese remainder theorem tells me that the $p\equiv1,7 \pmod{12}$.

Second way (I believe that it is the problematic one but yet I can't see what's wrong): $$\left(\frac{3}{p}\right)\left(\frac{-1}{p}\right)=\left(\frac{3}{p}\right)\cdot(-1)^{(p-1)/2}=\left(\frac{p}{3}\right)(-1)^{((p-1)/2)\cdot((3-1)/2)}\cdot(-1)^{(p-1)/2}=\left(\frac{p}{3}\right),$$ this equals $1$ only for $p \equiv 1 \pmod 3$.

What's wrong with the second way? I believe it's all legal.

Thanks a lot!

share|cite|improve this question
The first one is right, $p$ congruent to $1$ or $7$ modulo $12$. I would suggest not manipulating powers of $-1$, it surely is not that much extra work to separate the cases both congrent to $-1$ mod $4$, at least one congruent to $1$ mod $4$. – André Nicolas Jul 2 '12 at 18:46
Dear Jozef, Pete Clark has answered your question. Just to make a succint remark, if you look at your first approach, you prove "if $p \equiv 1 \bmod 4$ then $p \equiv 1 \bmod 3,$ while if $p \equiv -1 \bmod 4$ then again $p \equiv 1 \bmod 3$". In the second approach you prove simply that $p \equiv 1 \bmod 3$. These are evidently the same, since either $p \equiv 1 \bmod 4$ or $p \equiv -1 \bmod 4$. Regards, – Matt E Jul 2 '12 at 19:14
up vote 7 down vote accepted

Nothing's wrong. The answer is that for a prime $p > 3$, $\left( \frac{3}{p} \right) \left( \frac{-1}{p} \right) = 1 \iff p \equiv 1 \pmod 3$. Note that the possible residue classes modulo $12$ for a prime $p > 3$ are the ones which are coprime to $12$, i.e., $1,5,7,11$. Of these the ones congruent to $1$ modulo $3$ are $1$ and $7$.

Let me give you yet a third way to solve this problem. For an odd prime $p$, set $p^* = (-1)^{\frac{p-1}{2}} p$. Then an equivalent statement of quadratic reciprocity is that for distinct odd primes $p,q$,

$\left( \frac{p}{q} \right) = \left( \frac{q^*}{p} \right)$.

(Admittedly, verifying this is similar in nature to what you're doing! The point though is that this is a formula worth proving and then remembering.)

Applying this with $q = 3$, we get $\left( \frac{3}{p} \right) \left( \frac{-1}{p} \right) = \left( \frac{-3}{p} \right) = \left(\frac{p}{3} \right)$, which is $1$ iff $p \equiv 1 \pmod{3}$.

share|cite|improve this answer

They are the same thing: $p\equiv 1, 7\pmod {12}$ is the same as $p\equiv 1\pmod 3$ when $p$ is prime. That's because $p\equiv 4,10\pmod {12}$ is not possible when $p$ is prime.

share|cite|improve this answer

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.