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...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Fformat: | Livre numérique |
| Iaith: | Anglais |
| Cyhoeddwyd: |
New York, NY :
Springer New York
[20..].
Cham : Springer Nature |
| Cyfres: | Undergraduate Texts in Mathematics
|
| Pynciau: | |
| Mynediad Ar-lein: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nodyn: |
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 |
Tabl Cynhwysion:
- Prime Numbers The Ring of Integers Modulo n Public-key Cryptography Quadratic Reciprocity Continued Fractions Elliptic Curves.