2019
DOI: 10.1090/gsm/203
|View full text |Cite
|
Sign up to set email alerts
|

The Distribution of Prime Numbers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
52
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 39 publications
(52 citation statements)
references
References 0 publications
0
52
0
Order By: Relevance
“…We then set a = The sum over a equals q p (1 − q −1+εp ) −1 with q denoting a prime number. Since q εp = 1 + O(log q/ log p) for q p, Mertens' estimates [8,Theorem 3.4] imply that the sum over a is log p. We conclude that…”
Section: Preliminariesmentioning
confidence: 68%
See 1 more Smart Citation
“…We then set a = The sum over a equals q p (1 − q −1+εp ) −1 with q denoting a prime number. Since q εp = 1 + O(log q/ log p) for q p, Mertens' estimates [8,Theorem 3.4] imply that the sum over a is log p. We conclude that…”
Section: Preliminariesmentioning
confidence: 68%
“…from the inclusion-exclusion principle that has 2 #P 2 log x = o(x) steps (for example, see [8,Theorem 2.1]). Since p∈P\P (1 − 1/p) ∼ 1 by our assumption that p∈P 1/p < ∞, the proof is complete.…”
Section: Preliminariesmentioning
confidence: 99%
“…for q large enough by Mertens' estimate [19,Theorem 3.4]. Already the above inequalities show that only the primes (log q) 0.01 can affect the size of ϕ(q)/q.…”
Section: Progress Towards the Duffin-schaeffer Conjecturementioning
confidence: 93%
“…by Mertens' theorem [19,Theorem 3.4]. This is much smaller than e j /j 2 , so (2.10) should fail rarely as j → ∞.…”
Section: Progress Towards the Duffin-schaeffer Conjecturementioning
confidence: 97%
See 1 more Smart Citation