1

Suppose $p = 1 \bmod 3$, prove the following statements:

  1. prove that $x^2 + x + 1 = 0 \mod p$ has a solution
  2. Prove that $\left(\frac{-3}{p}\right) = 1$ if $p = 1\mod 3$
  3. Determine the discriminant of $x^2 + x + 1$
  4. Prove using 2,3 that $\left(\frac{-3}{p}\right) = -1$ if $p = -1\mod 3$

This is what I've tried by each question:

  1. prove $x^2 + x = -1 \mod p$ has a solution, i tried to find an x such that: $x^2 + x = a^{\frac{p-1}{2}} = -1 \mod p$, where we use that a is equal to a quadratic non-residue and use Euler. I don't seem to see why this is true though.
  2. Note the following: $(2x+1)^2 = 4x^2 + 4x + 4 = 4(x^2 + x + 1) - 3 = -3 \mod p$. So this solution exist and thus $-3$ must be a quadratic residue mod p.
  3. -3
  4. ?
Kees Til
  • 1,958
  • Have a look at this rather famous question: http://math.stackexchange.com/questions/685958/let-p-be-prime-and-frac-3p-1-prove-that-p-is-of-the-form-p-a23b2 – Jack D'Aurizio Oct 28 '15 at 14:25
  • 1
  • makes no sense as written. Also such "question dumps" are not really welcome.
  • – quid Oct 28 '15 at 14:30
  • 1
    What is $x$? Is it solve for $x$? – SchrodingersCat Oct 28 '15 at 14:33
  • sorry forgot the sentence has a solution i will edit it right away – Kees Til Oct 28 '15 at 14:36
  • 2
    The most straightforward way to evaluate most Legendre symbols $(a/p)$ is by using Quadratic Reciprocity. Is that one of the tools you already have? – André Nicolas Oct 28 '15 at 16:38
  • yes, i forgot to put a missing minus in 4, otherwise it would be very easy indeed. – Kees Til Oct 28 '15 at 16:42
  • For 1, consider $g^{\frac{p-1}{3}}$, where $g$ is a primitive root mod $p$. – Aravind Oct 28 '15 at 17:08