• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Number Theory with Computations

Number Theory with Computations

Paperback

Series: Springer Undergraduate Mathematics

General Mathematics

ISBN10: 3031638131
ISBN13: 9783031638138
Publisher: Springer
Published: Sep 3 2024
Pages: 442
Weight: 1.70
Height: 0.80 Width: 6.15 Depth: 9.29
Language: English

This introductory text is designed for undergraduate courses in number theory, covering both elementary number theory and analytic number theory. The book emphasises computational aspects, including algorithms and their implementation in Python.

The book is divided into two parts. The first part, on elementary number theory, deals with concepts such as induction, divisibility, congruences, primitive roots, cryptography, and continued fractions. The second part is devoted to analytic number theory and includes chapters on Dirichlet's theorem on primes in arithmetic progressions, the prime number theorem, smooth numbers, and the famous circle method of Hardy and Littlewood. The book contains many topics not often found in introductory textbooks, such as Aubry's theorem, the Tonelli-Shanks algorithm, factorisation methods, continued fraction representations of e, and the irrationality of ��(3). Each chapter concludes with a summary and notes, as well as numerous exercises.

Also in

General Mathematics