Elementary Number Theory: Primes, Congruences, and Secrets
A Computational Approach
(Sprache: Englisch)
Classical number theory and elliptic curves are examined in this textbook, which moves on from elementary topics such as primes, continued fractions, and quadratic forms, to elliptic curves and their applications to algorithmic and number theory problems.
Jetzt vorbestellen
versandkostenfrei
Buch (Gebunden)
60.49 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Elementary Number Theory: Primes, Congruences, and Secrets “
Classical number theory and elliptic curves are examined in this textbook, which moves on from elementary topics such as primes, continued fractions, and quadratic forms, to elliptic curves and their applications to algorithmic and number theory problems.
Klappentext zu „Elementary Number Theory: Primes, Congruences, and Secrets “
This is a book about prime numbers, congruences, secret messages, and elliptic curves that you can read cover to cover. It grew out of undergr- uate courses that the author taught at Harvard, UC San Diego, and the University of Washington. The systematic study of number theory was initiated around 300B. C. when Euclid proved that there are in?nitely many prime numbers, and also cleverly deduced the fundamental theorem of arithmetic, which asserts that every positive integer factors uniquely as a product of primes. Over a thousand years later (around 972A. D. ) Arab mathematicians formulated the congruent number problem that asks for a way to decide whether or not a given positive integer n is the area of a right triangle, all three of whose sides are rational numbers. Then another thousand years later (in 1976), Di?e and Hellman introduced the ?rst ever public-key cryptosystem, which enabled two people to communicate secretely over a public communications channel with no predeterminedsecret; this invention and the ones that followed it revolutionized the world of digital communication. In the 1980s and 1990s, elliptic curves revolutionized number theory, providing striking new insights into the congruent number problem, primality testing, publ- key cryptography, attacks on public-key systems, and playing a central role in Andrew Wiles' resolution of Fermat's Last Theorem.
This is a textbook about classical elementary number theory and elliptic curves. The first part discusses elementary topics such as primes, factorization, continued fractions, and quadratic forms, in the context of cryptography, computation, and deep open research problems. The second part is about elliptic curves, their applications to algorithmic problems, and their connections with problems in number theory such as Fermat's Last Theorem, the Congruent Number Problem, and the Conjecture of Birch and Swinnerton-Dyer. The intended audience of this book is an undergraduate with some familiarity with basic abstract algebra, e.g. rings, fields, and finite abelian groups.
Inhaltsverzeichnis zu „Elementary Number Theory: Primes, Congruences, and Secrets “
Prime Numbers.- The Ring of Integers Modulo n.- Public-key Cryptography.- Quadratic Reciprocity.- Continued Fractions.- Elliptic Curves.
Bibliographische Angaben
- Autor: William Stein
- 2008, 2009, X, 168 Seiten, Maße: 16 x 24,1 cm, Gebunden, Englisch
- Verlag: Springer, Berlin
- ISBN-10: 0387855246
- ISBN-13: 9780387855240
Sprache:
Englisch
Rezension zu „Elementary Number Theory: Primes, Congruences, and Secrets “
From the reviews:"This one treats topics that have become standard in recent years ... and it has exercises with selected solutions. ... it gives the students a tool to do calculations that illustrate even the most abstract concepts, and, simultaneously, introduces them to an open source software that can later be applied profitably for studying research problems. ... introducing the reader to a powerful software system." (Franz Lemmermeyer, Zentralblatt MATH, Vol. 1155, 2009)"The cliché that number theory, ever the purest mathematics, now yields very practical applications barely tells the story. Teach undergraduate number theory today, and students demand to hear about public-key cryptography and related technologies. ... Stein (Univ. of Washington) serves undergraduates well by ... opening the way by intimating their power. ... he frames the sophisticated Birch and Swinnerton-Dyer conjecture as the new canonical challenge for the future. Summing Up: Recommended. All undergraduates students, professionals, and general readers." (D. V. Feldman, Choice, Vol. 47 (2), October, 2009)"This book is an introduction to elementary number theory with a computational flavor. ... Many numerical examples are given throughout the book using the Sage mathematical software. The text is aimed at an undergraduate student with a basic knowledge of groups, rings and fields. Each chapter concludes with several exercises." (Samuel S. Wagstaff Jr., Mathematical Reviews, Issue 2009 i)
Pressezitat
From the reviews: "This one treats topics that have become standard in recent years ... and it has exercises with selected solutions. ... it gives the students a tool to do calculations that illustrate even the most abstract concepts, and, simultaneously, introduces them to an open source software that can later be applied profitably for studying research problems. ... introducing the reader to a powerful software system." (Franz Lemmermeyer, Zentralblatt MATH, Vol. 1155, 2009)
"The cliché that number theory, ever the purest mathematics, now yields very practical applications barely tells the story. Teach undergraduate number theory today, and students demand to hear about public-key cryptography and related technologies. ... Stein (Univ. of Washington) serves undergraduates well by ... opening the way by intimating their power. ... he frames the sophisticated Birch and Swinnerton-Dyer conjecture as the new canonical challenge for the future. Summing Up: Recommended. All undergraduates students, professionals, and general readers." (D. V. Feldman, Choice, Vol. 47 (2), October, 2009)
"This book is an introduction to elementary number theory with a computational flavor. ... Many numerical examples are given throughout the book using the Sage mathematical software. The text is aimed at an undergraduate student with a basic knowledge of groups, rings and fields. Each chapter concludes with several exercises." (Samuel S. Wagstaff Jr., Mathematical Reviews, Issue 2009 i)
Kommentar zu "Elementary Number Theory: Primes, Congruences, and Secrets"
Schreiben Sie einen Kommentar zu "Elementary Number Theory: Primes, Congruences, and Secrets".
Kommentar verfassen