Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Quadratic reciprocity
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Euler=== Translated into modern notation, Euler stated <ref>Lemmermeyer, p. 5, Ireland & Rosen, pp. 54, 61</ref> that for distinct odd primes ''p'' and ''q'': # If ''q'' β‘ 1 (mod 4) then ''q'' is a quadratic residue (mod ''p'') if and only if there exists some integer ''b'' such that ''p'' β‘ ''b''<sup>2</sup> (mod ''q''). # If ''q'' β‘ 3 (mod 4) then ''q'' is a quadratic residue (mod ''p'') if and only if there exists some integer ''b'' which is odd and not divisible by ''q'' such that ''p'' β‘ Β±''b''<sup>2</sup> (mod 4''q''). This is equivalent to quadratic reciprocity. He could not prove it, but he did prove the second supplement.<ref>Ireland & Rosen, pp. 69–70. His proof is based on what are now called Gauss sums.</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)