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 residue
(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!
==References== The ''[[Disquisitiones Arithmeticae]]'' has been translated from Gauss's [[Classical Latin|Ciceronian Latin]] into [[English language|English]] and [[German language|German]]. The German edition includes all of his papers on number theory: all the proofs of quadratic reciprocity, the determination of the sign of the [[Gauss sum]], the investigations into [[biquadratic reciprocity]], and unpublished notes. *{{citation | last = Gauss | first = Carl Friedrich | translator-last = Clarke | translator-first = Arthur A. | title = Disquisitiones Arithemeticae |edition=Second corrected | publisher = [[Springer Science+Business Media|Springer]] | location = New York | year = 1986 | isbn = 0-387-96254-9}} *{{citation | last = Gauss | first = Carl Friedrich | translator-last = Maser | translator-first = H. | title = Untersuchungen รผber hohere Arithmetik |trans-title=Disquisitiones Arithemeticae & other papers on number theory |edition=second | publisher = Chelsea | location = New York | year = 1965 | isbn = 0-8284-0191-8}} *{{citation | last1 = Bach | first1 = Eric | last2 = Shallit | first2 = Jeffrey | series = Algorithmic Number Theory |volume=I |title=Efficient Algorithms | publisher = [[The MIT Press]] | location = Cambridge | year = 1996 | isbn = 0-262-02405-5}} *{{citation | last1 = Crandall | first1 = Richard | last2 = Pomerance | first2 = Carl | title = Prime Numbers: A Computational Perspective | publisher = Springer | location = New York | year = 2001 | isbn = 0-387-94777-9}} *{{Citation | last = Davenport | first = Harold | title = Multiplicative Number Theory |edition=third | publisher = Springer | location = New York | year = 2000 | isbn = 0-387-95097-4}} *{{Citation |last1=Garey |first1=Michael R. |author-link=Michael R. Garey |last2=Johnson |first2=David S. |author2-link=David S. Johnson |year=1979 |title=Computers and Intractability: A Guide to the Theory of NP-Completeness |publisher=W. H. Freeman |isbn=0-7167-1045-5 |url-access=registration |url=https://archive.org/details/computersintract0000gare }} A7.1: AN1, pg.249. *{{citation |last1 = Hardy |first1 = G. H. |last2 = Wright |first2 = E. M. |author1-link = G. H. Hardy |author2-link = E. M. Wright |title = An Introduction to the Theory of Numbers |edition = fifth |publisher = [[Oxford University Press]] |location = Oxford |year = 1980 |isbn = 978-0-19-853171-5 |url-access = registration |url = https://archive.org/details/introductiontoth00hard }} *{{citation | last1 = Ireland | first1 = Kenneth | last2 = Rosen | first2 = Michael | title = A Classical Introduction to Modern Number Theory |edition=second | publisher = Springer | location = New York | year = 1990 | isbn = 0-387-97329-X}} *{{citation | last1 = Lemmermeyer | first1 = Franz | title = Reciprocity Laws: from Euler to Eisenstein | publisher = Springer | location = Berlin | year = 2000 | isbn = 3-540-66957-4}} *{{Citation |first1=Kenneth L. |last1=Manders |last2=Adleman |first2=Leonard |author2-link=Leonard Adleman |title = ''NP''-Complete Decision Problems for Binary Quadratics |journal = Journal of Computer and System Sciences |volume=16 |issue=2 |year=1978 |pages = 168–184 |doi = 10.1016/0022-0000(78)90044-2 |postscript = .|doi-access=free }}
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)