Abstract
dc:description"We review the body of work done on prime number races, specifically the results involving infinitely many lead changes in prime number races. We describe a computational way of showing that any race has infinitely many lead changes and greatly expand the known results in this area. An extension of the traditional prime number race problem is discussed where we race ""quasi-primes"" or composite numbers that are the product of two odd primes modulo 4. We then consider what ""percentage"" of the time that the residue class 1 leads the residue class 3 in this ""quasi-prime"" race modulo 4."
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Sneed, Jason P.
- Contributors dc:contributor
-
- Hildebrand, A.J.
- Kevin Ford
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI3411454
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/86936