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

William Stein, "Elementary Number Theory: Primes, Congruences, and Secrets: A Computational Approach"
S-r | 2009 | ISBN: 0387855246 | 176 pages | File type: PDF | 2,1 mb

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.

Download links:

http://uploading.com/files/82e398ee/0387855246ElementaryNumber.rar/

http://depositfiles.com/files/84t0lzkp3

http://www.filesonic.com/file/33406265/0387855246ElementaryNumber.rar

[Fast Download] Elementary Number Theory: Primes, Congruences, and Secrets: A Computational Approach

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.