Modular Forms: A Computational Approach
by William A. Stein
Publisher: American Mathematical Society 2007
Number of pages: 282
This marvellous and highly original book fills a significant gap in the extensive literature on classical modular forms. This is not just yet another introductory text to this theory, though it could certainly be used as such in conjunction with more traditional treatments. Its novelty lies in its computational emphasis throughout.
Home page url
Download or read it online for free here:
by J.P. Buhler, P. Stevenhagen - Cambridge University Press
This text provides a comprehensive introduction to algorithmic number theory for beginning graduate students. It covers the fundamental algorithms of elementary number theory, lattice basis reduction, elliptic curves, algebraic number fields, etc.
by Victor Shoup - Cambridge University Press
This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes. It is accessible to a broad audience. Prerequisites are a typical undergraduate course in calculus and some experience in doing proofs.
by Andrew Granville - Universite de Montreal
The analysis of many number theoretic algorithms turns on the role played by integers which have only small prime factors -- 'smooth numbers'. It is important to have accurate estimates for the number of smooth numbers in various sequences.
by Henry Ibstedt - American Research Press
This is a book on empirical number theory concentrating on the analysis of number sequences. Its focus is on a small part of integer sequences defined by Florentin Smarandache. The author has also included some other results of his research.