The problem
Let and be distinct odd primes. For an integer and an odd prime , the Legendre symbol is if is a non-zero square modulo , if it is not a square, and if divides .
Show that
Gauss called it the golden theorem and gave several proofs. A great many have followed, and they come from counting, from geometry, from algebra and from analysis.
0 proofs posted
0 votes castNo proofs yet
Be the first to put an argument on the board.