Gaussian Periods
As before, let be a primitive 17th root of unity. Define by
These are examples of Gaussian periods. We stated before that is a rational that is easy to compute. Why?
Write as
for integers . Replacing with merely swaps and due to their construction, whence
Thus looking at the coefficients of the powers of we have , that is, they are all equal to some integer :
Thus is some rational number.
To compute , we count the number of times that where is a quadratic residue modulo 17 and is a nonresidue, and then count the number of times that . Since we know the answer is rational, each power of appears exactly times so the answer is .
Since we know is a quadratic residue, hence if is a quadratic residue so is . This means . Unfortunately I don’t know how to quickly count the number of ways . From the list of powers of 3, the quadratic residues are
Since is also a quadratic residue we can count the solutions to instead, in other words, if is a quadratic residue how often is a quadratic nonresidue?
We see for that is not a quadratic residue, so , hence .
We can generalize these statements.
A Loose End
Before we argued that given
we can equate coefficients of the powers of . Let us see why. In the above equation, we can move all terms to one side then divide through by to find such that
(each is the difference between some and ). Then consider the polynomial . Now is a root of as well as the polynomial
Hence must also be a root of . If , then the polynomial is a nonzero polynomial dividing with degree at most , which is smaller than the degree of . This is a contradiction since has no factors with rational coefficients (by Eisenstein).
Thus must be the zero polynomial, and we may equate the coefficients of the powers of .
[In abstract algebra, we say all this in one line: is a degree 17 extension of thus .]