scholarly journals Variants on Andrica’s Conjecture with and without the Riemann Hypothesis

Mathematics ◽  
2018 ◽  
Vol 6 (12) ◽  
pp. 289 ◽  
Author(s):  
Matt Visser
Keyword(s):  
Riemann Hypothesis ◽  
Distribution Of Primes

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.

scholarly journals Limiting Properties of the Distribution of Primes in an Arbitrarily Large Number of Residue Classes

2020 ◽  
Vol 63 (4) ◽  
pp. 837-849 ◽  
Author(s):  
Lucile Devin
Keyword(s):  
Riemann Hypothesis ◽  
Linear Independence ◽  
Classical Case ◽  
Weak Version ◽  
Distribution Of Primes ◽  
Logarithmic Density ◽  
Fixed Integer ◽  
Residue Classes ◽  
Independence Hypothesis ◽  
And Function

AbstractWe generalize current known distribution results on Shanks–Rényi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function field analogues developed in the recent years. More precisely, let $\unicode[STIX]{x1D70B}(x;q,a)$ be the number of primes up to $x$ that are congruent to $a$ modulo $q$. For a fixed integer $q$ and distinct invertible congruence classes $a_{0},a_{1},\ldots ,a_{D}$, assuming the generalized Riemann Hypothesis and a weak version of the linear independence hypothesis, we show that the set of real $x$ for which the inequalities $\unicode[STIX]{x1D70B}(x;q,a_{0})>\unicode[STIX]{x1D70B}(x;q,a_{1})>\cdots >\unicode[STIX]{x1D70B}(x;q,a_{D})$ are simultaneously satisfied admits a logarithmic density.

scholarly journals On the Riemann hypothesis and the difference between primes

2015 ◽  
Vol 11 (03) ◽  
pp. 771-778 ◽  
Author(s):  
Adrian W. Dudek
Keyword(s):  
Riemann Hypothesis ◽  
Distribution Of Primes ◽  
Explicit Result ◽  
The Difference

We prove some results concerning the distribution of primes assuming the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval [Formula: see text] for all x ≥ 2; this improves a result of Ramaré and Saouter. We then show that the constant 4/π may be reduced to (1 + ϵ) provided that x is taken to be sufficiently large. From this, we get an immediate estimate for a well-known theorem of Cramér, in that we show the number of primes in the interval [Formula: see text] is greater than [Formula: see text] for c = 3 + ϵ and all sufficiently large values of x.

8. How to win a million dollars

2020 ◽  
pp. 129-141
Author(s):  
Robin Wilson
Keyword(s):  
Zeta Function ◽  
Riemann Hypothesis ◽  
Counting Function ◽  
Exact Formula ◽  
Arithmetic Functions ◽  
Complex Numbers ◽  
Distribution Of Primes ◽  
Bernhard Riemann

What is the Riemann hypothesis, and why does it matter? ‘How to win a million dollars’ looks in detail at Riemann’s conjecture. While Gauss attempted to explain why primes thin out, Bernhard Riemann in 1859 proposed an exact formula for the distribution of primes, employing Euler’s ‘zeta function’ and the idea of complex numbers. In 2000, the Clay Mathematics Institute offered a million dollars for the solutions of each of seven famous problems, of which the Riemann hypothesis was one. The Riemann hypothesis implies strong bounds on the growth of other arithmetic functions, in addition to the primes-counting function. It remains one of the most famous unsolved problems of mathematics.

Riemann Hypothesis from the Physicist’s Point of View

2020 ◽  
Vol 8 (3) ◽  
pp. 01-10
Author(s):  
Yuriy Zayko
Keyword(s):  
Zeta Function ◽  
Riemann Zeta Function ◽  
Riemann Hypothesis ◽  
Point Of View ◽  
Distribution Of Primes ◽  
Computation Model ◽  
The Riemann Zeta Function ◽  
Real Argument ◽  
Riemann Zeta ◽  
Artificial Intelligence Systems

This article presents an attempt to comprehend the evolution of the ideas underlying the physical approach to the proof of one of the problems of the century - the Riemann hypothesis regarding the location of non-trivial zeros of the Riemann zeta function. Various formulations of this hypothesis are presented, which make it possible to clarify its connection with the distribution of primes in the set of natural numbers. A brief overview of the main directions of this approach is given. The probable cause of their failures is indicated - the solution of the problem within the framework of the classical Turing paradigm. A successful proof of the Riemann hypothesis based on the use of a relativistic computation model that allows one to overcome the Turing barrier is presented. This model has been previously applied to solve another problem not computable on the classical Turing machine - the calculation of the sums of divergent series for the Riemann zeta function of the real argument. The possibility of using relativistic computing for the development of artificial intelligence systems is noted.

scholarly journals THE CONJECTURE IMPLIES THE RIEMANN HYPOTHESIS

Mathematika ◽  
2016 ◽  
Vol 63 (1) ◽  
pp. 29-33 ◽  
Author(s):  
Sandro Bettin ◽  
Steven M. Gonek
Keyword(s):  
Riemann Hypothesis

scholarly journals ADDITIVE BASES AND NIVEN NUMBERS

2021 ◽  
pp. 1-8
Author(s):  
CARLO SANNA
Keyword(s):  
Positive Integer ◽  
Natural Number ◽  
Riemann Hypothesis ◽  
Additive Basis

Abstract Let $g \geq 2$ be an integer. A natural number is said to be a base-g Niven number if it is divisible by the sum of its base-g digits. Assuming Hooley’s Riemann hypothesis, we prove that the set of base-g Niven numbers is an additive basis, that is, there exists a positive integer $C_g$ such that every natural number is the sum of at most $C_g$ base-g Niven numbers.

scholarly journals On Fourier Coefficients of the Symmetric Square L-Function at Piatetski-Shapiro Prime Twins

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1254
Author(s):  
Xue Han ◽  
Xiaofei Yan ◽  
Deyu Zhang
Keyword(s):  
Asymptotic Formula ◽  
Fourier Coefficient ◽  
Cusp Form ◽  
Riemann Hypothesis ◽  
Modular Group ◽  
Fourier Coefficients ◽  
Mean Value ◽  
Symmetric Square ◽  
The Mean ◽  
Almost All

Let Pc(x)={p≤x|p,[pc]areprimes},c∈R+∖N and λsym2f(n) be the n-th Fourier coefficient associated with the symmetric square L-function L(s,sym2f). For any A>0, we prove that the mean value of λsym2f(n) over Pc(x) is ≪xlog−A−2x for almost all c∈ε,(5+3)/8−ε in the sense of Lebesgue measure. Furthermore, it holds for all c∈(0,1) under the Riemann Hypothesis. Furthermore, we obtain that asymptotic formula for λf2(n) over Pc(x) is ∑p,qprimep≤x,q=[pc]λf2(p)=xclog2x(1+o(1)), for almost all c∈ε,(5+3)/8−ε, where λf(n) is the normalized n-th Fourier coefficient associated with a holomorphic cusp form f for the full modular group.

Sign in / Sign up

Export Citation Format

Share Document