# Proving without reciprocity laws that if $p>0$ a prime such $p=1(5)$ then 5 is a quadratic residue mod $p$.

I've done a similar problem where $p=1(3)$ and showed that $-3$ is a quadratic residue modulo $p$. These problems are sledgehammered by reciprocity laws, so I am trying to prove it directly using the fact that $U(\mathbb{Z}/p\mathbb{Z})$ is cyclic of order $p-1$ and since $p=3k+1$ we know the order of the group is a multiple of $3$ and therefore it has an element of order 3, say $r$. We know that $4+4r+4r^2=0 (p)$ if we multiply the LHS by $r$ which is not a unit we get the same thing back. From here we just rearrange and get $4r^2+4r+1=-3(p)$ and the LHS is just $(2r+1)^2$ so $-3$ is a residue.

I've been trying to do the same thing for 5, but I can't get it to work. That is, starting from $1+k+k^2+k^3+k^4=0(p)$ where $k$ is an element of order five in $U$, getting something of the form $(f(k))^2=5(p)$ where $f(x)$ is a polynomial with integer coefficients.

-

Hint : Using a fifth root of unity try to construct $\sqrt{5}$ using an algebraic expression. As an example of what this means, if $\omega$ is a primitive third root of unity we have $\omega - \omega^2 = \pm \sqrt{3}$. If you know what the discriminant of a polynomial is, trying finding the discriminant of the $5^{th}$ cyclotomic polynomial to help you. Or you can look to Gauss Sums to find an expression as well.
In case you decide to give up, try to show $(\omega - \omega^2 - \omega^3 + \omega^4)^2 = 5$. The expression inside the square is just a Gauss sum.
Thanks, I see that $(x-x^2-x^3+x^4)^2$ just the useful form that I needed! –  Steven-Owen Oct 30 '12 at 22:36