On the theory of distribution of primes based on I. M. Vinogradov’s method of trigonometric sums

Author(s):  
A. F. Lavrik
Author(s):  
K. N. Harshitha ◽  
K. R. Vasuki ◽  
M. V. Yathirajsharma

Mathematics ◽  
2018 ◽  
Vol 6 (12) ◽  
pp. 289 ◽  
Author(s):  
Matt Visser

The gap between what we can explicitly prove regarding the distribution of primes and what we suspect regarding the distribution of primes is enormous. It is (reasonably) well-known that the Riemann hypothesis is not sufficient to prove Andrica’s conjecture: ∀n≥1, is p n + 1 - p n ≤ 1 ? However, can one at least get tolerably close? I shall first show that with a logarithmic modification, provided one assumes the Riemann hypothesis, one has p n + 1 /ln p n + 1 - p n /ln p n < 11/25; (n ≥ 1). Then, by considering more general mth roots, again assuming the Riemann hypothesis, I show that p n + 1 m - p n m < 44/(25 e[m < 2]); (n ≥ 3; m > 2). In counterpoint, if we limit ourselves to what we can currently prove unconditionally, then the only explicit Andrica-like results seem to be variants on the relatively weak results below: ln2 pn + 1 - ln2 pn < 9; ln3 pn + 1 - ln3 pn < 52; ln4 pn + 1 - ln4 pn < 991; (n ≥ 1). I shall also update the region on which Andrica’s conjecture is unconditionally verified.


1986 ◽  
Vol 39 (2) ◽  
pp. 89-97
Author(s):  
S. A. Stepanov

1976 ◽  
Vol 10 (1) ◽  
pp. 200-210 ◽  
Author(s):  
G I Arhipov ◽  
V N Čubarikov
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document