1962
DOI: 10.1007/bf02020798
|View full text |Cite
|
Sign up to set email alerts
|

Comparative prime-number theory. III

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
10
0
1

Year Published

1963
1963
2017
2017

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(11 citation statements)
references
References 8 publications
0
10
0
1
Order By: Relevance
“…This observation led to the birth of comparative prime number theory, which investigates the discrepancies in the distribution of prime numbers. A central problem is the so-called "Shanks-Rényi prime number race" which is described by Knapowski and Turán [13]: let q ≥ 3 and 2 ≤ n ≤ ϕ(q) be positive integers, (where the Euler function ϕ(q) denotes the number of residue classes mod q that are coprime to q), and denote by A n (q) the set of ordered n-tuples (a 1 , a 2 , . .…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…This observation led to the birth of comparative prime number theory, which investigates the discrepancies in the distribution of prime numbers. A central problem is the so-called "Shanks-Rényi prime number race" which is described by Knapowski and Turán [13]: let q ≥ 3 and 2 ≤ n ≤ ϕ(q) be positive integers, (where the Euler function ϕ(q) denotes the number of residue classes mod q that are coprime to q), and denote by A n (q) the set of ordered n-tuples (a 1 , a 2 , . .…”
Section: Introductionmentioning
confidence: 99%
“…, a n ) ∈ A n (q) consider a game with n players called "a 1 " through to "a n ", where at time x, the player a j has a score of π(x; q, a j ) (where π(x; q, a) denotes the number of primes p ≤ x with p ≡ a mod q). Among the questions that Knapowski and Turán asked in [13] are the following: Q1. Will each player take the lead for infinitely many integers x?…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…A classical problem in analytic number theory is the so-called "Shanks-Rényi prime number race" which concerns the distribution of prime numbers in arithmetic progressions. As colorfully described by Knapowski and Turán in [11], let q ≥ 3 and 2 ≤ r ≤ φ(q) be positive integers, and denote by A r (q) the set of ordered r-tuples of distinct residue classes (a 1 , a 2 , . .…”
Section: Introductionmentioning
confidence: 99%
“…An old result of Littlewood [14] shows that this is indeed true in the special cases (q, a 1 , a 2 ) = (4, 1, 3) and (q, a 1 , a 2 ) = (3, 1, 2). Since then, this problem has been extensively studied by many authors, including Knapowski and Turán [11], Bays and Hudson [1] and [2], Kaczorowski [8], [9] and [10], Feuerverger and Martin [4], Martin [15], Ford and Konyagin [6] and [7], Fiorilli and Martin [5], and the author [12] and [13].…”
Section: Introductionmentioning
confidence: 99%