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

• Category: Computer
• Author: William Stein
• Pages: /Paperback 168 pages
• File type: PDF (172 pages, 2.6 MB)

Read and download free eBook intituled Elementary Number Theory: Primes, Congruences, and Secrets: A Computational Approach in format PDF (172 pages, 2.6 MB) – /Paperback 168 pages created by William Stein.

This book is an introduction to elementary number theory with a computational flavor. Many numerical examples are given throughout the book using the Sage mathematical software. The text is aimed at an undergraduate student with a basic knowledge of groups, rings and fields. Each chapter concludes with several exercises.

It’s all about prime numbers, congruences, secret messages, and elliptic curves that you can read cover to cover. It grew out of undergruate courses that the author taught at Harvard, UC San Diego, and the University of Washington.

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.

Read and Download Links:

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