Analytic Computation of the Prime -Counting Function
Galway, William Floyd
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/86834
Description
Title
Analytic Computation of the Prime -Counting Function
Author(s)
Galway, William Floyd
Issue Date
2004
Doctoral Committee Chair(s)
Diamond, Harold G.
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
Our work resolves many issues left untreated in the original paper by Lagarias and Odlyzko and makes several original contributions---some of which have applications in other areas. In this dissertation we: (1) introduce a kernel function which appears to be more effective than the one suggested by Lagarias and Odlyzko; (2) perform a careful analysis of various sources of truncation error; (3) give choices of parameters which bound the truncation error while keeping computation to a minimum; (4) develop two new methods for enumerating primes in intervals, which require much less memory than previously known sieving methods and which are much faster than methods which test primality of single numbers; (5) describe a new method for computing zeta(s) which gives more accurate values with less complexity than classical methods.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
