Elementary Number Theory - Primes, Congruences and Secrets, A Computational Approach - W. Stein.pdf

Size 4.191 MB   9 seeders     Added 2013-03-07 13:02:50

To download or stream you need BitLord. Visit them at BitLord.com
Elementary Number Theory: Primes, Congruences, and Secrets: A Computational Approach (Undergraduate Texts in Mathematics) by William Stein,
Springer; 1st Edition, 2008, 178 pages.

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.

View TOC here. 
http://www.amazon.co.uk/Elementary-Number-Theory-Computational-Undergraduate/dp/0387855246
		
Elementary Number Theory - Primes, Congruences and Secrets, A Computational Approach - W. Stein.pdf 4.191 MB
Gathering some info...

Register and log in Isohunt and see no captcha anymore!

4000 symbols left
Hash 80a08cb9631cda97a6f81123e77eabfbbb5d1161