Logo

Smooth Numbers: Computational Number Theory and Beyond

Small book cover: Smooth Numbers: Computational Number Theory and Beyond

Smooth Numbers: Computational Number Theory and Beyond
by

Publisher: Universite de Montreal
Number of pages: 58

Description:
The analysis of many number theoretic algorithms turns on the role played by integers which have only small prime factors; such integers are known as 'smooth numbers'. To be able to determine which algorithm is faster than which, it has turned out to be important to have accurate estimates for the number of smooth numbers in various sequences.

Home page url

Download or read it online for free here:
Download link
(390KB, PDF)

Similar books

Book cover: Computer analysis of number sequencesComputer analysis of number sequences
by - 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.
(8587 views)
Book cover: A Computational Introduction to Number Theory and AlgebraA Computational Introduction to Number Theory and Algebra
by - 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.
(32304 views)
Book cover: Modular Forms: A Computational ApproachModular Forms: A Computational Approach
by - American Mathematical Society
This 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.
(5398 views)
Book cover: Algorithmic Number TheoryAlgorithmic Number Theory
by - 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.
(10143 views)