ENGLISH

Elementary Number Theory: Primes, Congruences, and Secrets: A Computational Approach

Book information

Publisher
Springer
Year
2009
ISBN
9780387855240, 9780387855257, 0387855246, 0387855254
DOI
10.1007/978-0-387-85525-7
ISSN
0172-6056
LCC
QA241 .S76 2009
Google Books ID
5hYd0yX4mrMC
Language
english
Format
PDF
Filesize
5 MB (4941174 bytes)
Series
Undergraduate Texts in Mathematics
Edition
1st Edition. 2nd Printing.
Pages
178\178
Orientation
yes
Scanned
no
Time added
2011-06-04 13:46:07

Description

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.

Similar books