83 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009.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.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD
Abweichender Titel nach Übersetzung der Verfasserin/des VerfassersPrime numbers have been a signific...
In preivous years, the author worked with patterns in prime numbers in different situations. It mean...
This article provides a new way to determine the decrease in prime numbers, the reasons for the mess...
83 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009.We review the body of work don...
We investigate the race between prime numbers in many residue classes modulo q, assuming the standar...
Let \( \pi(x;q,a) \) denote the number of primes up to \(x\) that are congruent to \(a( \text{mod }q...
International audienceAbstract We generalize current known distribution results on Shanks–Rényi prim...
Dirichlet in 1837 proved that for any a, q with (a, q) = 1 there are infinitely many primes p with ...
Throughout this lecture, n denotes an integer larger than 1. We call n composite if there exist inte...
The fundamental theorem of arithmetic states that any composite natural integer can be expressed in ...
Using A. Weil’s estimates the authors have given bounds for the largest prime P0 such that all prime...
Starting from the result that the prime distribution is deterministic, we show in its maximal reduce...
This paper is concerned with formulation and demonstration of new versions of equations that can hel...
Knowlegde about number theory and prime numbersPrime number race of the cumulative number of primes ...
The Fundamental Theorem of Arithmetic states that every composite integer can be written as a unique...
Abweichender Titel nach Übersetzung der Verfasserin/des VerfassersPrime numbers have been a signific...
In preivous years, the author worked with patterns in prime numbers in different situations. It mean...
This article provides a new way to determine the decrease in prime numbers, the reasons for the mess...
83 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009.We review the body of work don...
We investigate the race between prime numbers in many residue classes modulo q, assuming the standar...
Let \( \pi(x;q,a) \) denote the number of primes up to \(x\) that are congruent to \(a( \text{mod }q...
International audienceAbstract We generalize current known distribution results on Shanks–Rényi prim...
Dirichlet in 1837 proved that for any a, q with (a, q) = 1 there are infinitely many primes p with ...
Throughout this lecture, n denotes an integer larger than 1. We call n composite if there exist inte...
The fundamental theorem of arithmetic states that any composite natural integer can be expressed in ...
Using A. Weil’s estimates the authors have given bounds for the largest prime P0 such that all prime...
Starting from the result that the prime distribution is deterministic, we show in its maximal reduce...
This paper is concerned with formulation and demonstration of new versions of equations that can hel...
Knowlegde about number theory and prime numbersPrime number race of the cumulative number of primes ...
The Fundamental Theorem of Arithmetic states that every composite integer can be written as a unique...
Abweichender Titel nach Übersetzung der Verfasserin/des VerfassersPrime numbers have been a signific...
In preivous years, the author worked with patterns in prime numbers in different situations. It mean...
This article provides a new way to determine the decrease in prime numbers, the reasons for the mess...