ENGLISH

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

Book information

Publisher
Springer
Year
2010
ISBN
1441927522, 9781441927521
Language
english
Format
PDF
Filesize
3 MB (3525192 bytes)
Edition
online edition (172p., 16. November 2011)
Pages
180\172
Scanned
no
Time added
2012-03-09 12:00:00

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