Elementary number theory : primes, congruences, and secrets : a computational approach
The systematic study of number theory was initiated around 300B.C. when Euclid proved that there are infinitely many prime numbers. At the same time, he also cleverly deduced the fundamental theorem of arithmetic, which asserts that every positive integer factors uniquely as a product of primes. Ove...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
New York, NY :
Springer New York
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Undergraduate Texts in Mathematics
|
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Description d'après consultation du 20 octobre 2011 Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Elementary number theory, primes, congruences, and secrets, a computational approach, William Stein, New York, NY, Springer, 2009, 1 vol. (X-166 p.), Undergraduate texts in mathematics, 978-0-387-85524-0 |
| LEADER | 04594nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 940928 | ||
| 008 | 090210q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN131117122 | ||
| 020 | |a 9780387855257 | ||
| 041 | 0 | |a eng | |
| 082 | |a 512.7 | ||
| 084 | |a 11Axx. 2000 | ||
| 084 | |a 11-XX. 2000 | ||
| 100 | 1 | |a Stein, William, |d 1974- | |
| 245 | 1 | 0 | |a Elementary number theory : |b primes, congruences, and secrets : a computational approach |c William Stein. |
| 260 | |a New York, NY : |b Springer New York. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Undergraduate Texts in Mathematics |x 0172-6056 | |
| 500 | |a Description d'après consultation du 20 octobre 2011 | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 504 | |a Bibliogr. Index | ||
| 505 | 1 | |a Prime Numbers The Ring of Integers Modulo n Public-key Cryptography Quadratic Reciprocity Continued Fractions Elliptic Curves. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a The systematic study of number theory was initiated around 300B.C. when Euclid proved that there are infinitely many prime numbers. At the same time, he also cleverly deduced the fundamental theorem of arithmetic, which asserts that every positive integer factors uniquely as a product of primes. Over 1000 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 1000 years later (in 1976), Diffie and Hellman introduced the first ever public-key cryptosystem, which enabled two people to communicate secretly over a public communications channel with no predetermined secret; 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, public-key cryptography, attacks on public-key systems, and playing a central role in Andrew Wiles' resolution of Fermat's Last Theorem. Today, pure and applied number theory is an exciting mix of simultaneously broad and deep theory, which is constantly informed and motivated by algorithms and explicit computation. Active research is underway that promises to resolve the congruent number problem, deepen our understanding into the structure of prime numbers, and both challenge and improve our ability to communicate securely. The goal of this book is to bring the reader closer to this world. Each chapter contains exercises, and throughout the text there are examples of calculations done using the powerful free open source mathematical software system Sage. The reader should know how to read and write mathematical proofs and must know the basics of groups, rings, and fields. Thus, the prerequisites for this book are more than the prerequisites for most elementary number theory books, while still being aimed at undergraduates. William Stein is an Associate Professor of Mathematics at the University of Washington. He is also the author of Modular Forms, A Computational Approach (AMS 2007), and the lead developer of the open source software, Sage | ||
| 650 | |a Groupes, Théorie des | ||
| 650 | |a Nombres, Théorie des | ||
| 650 | |a Théorie des graphes | ||
| 776 | 0 | |0 144909383 |t Elementary number theory |o primes, congruences, and secrets |o a computational approach |f William Stein |c New York, NY |n Springer |d 2009 |p 1 vol. (X-166 p.) |s Undergraduate texts in mathematics |z 978-0-387-85524-0 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b13279 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-DJF3L59Z-Q |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747852413 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b13279 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750870036 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b13279 |z Accès INSA CVL | |
| 997 | |0 940928 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||