On the Riemann hypothesis and the difference between primes

@article{Dudek2014OnTR,
  title={On the Riemann hypothesis and the difference between primes},
  author={Adrian W. Dudek},
  journal={International Journal of Number Theory},
  year={2014},
  volume={11},
  pages={771-778}
}
  • Adrian W. Dudek
  • Published 26 February 2014
  • Mathematics
  • International Journal of Number Theory
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 $(x-\frac{4}{\pi} \sqrt{x}... 
Primes and prime ideals in short intervals
We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the
Primes in explicit short intervals on RH
On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.
A Conditional Explicit Result for the Prime Number Theorem in Short Intervals
We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.
Fourier optimization and prime gaps
We investigate some extremal problems in Fourier analysis and their connection to a problem in prime number theory. In particular, we improve the current bounds for the largest possible gap between
Explicit interval estimates for prime numbers
Using a smoothing function and recent knowledge on the zeros of the Riemann zeta-function, we compute pairs of $(\Delta, x_0)$ such that for all $x \geq x_0$ there exists at least one prime in the
The Prime Gaps Between Successive Primes to Ensure that there is Atleast One Prime Between Their Squares Assuming the Truth of the Riemann Hypothesis
Based on Dudek’s proof that assumed the truth of the Riemann’s hypothesis, that there exists a prime between {x – (4/pi)( x^ 1/2)(log x)} and x, we determine the size of prime gaps that must exist
Explicit Estimates in the Theory of Prime Numbers
It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that
On the error term in the explicit formula of Riemann--von Mangoldt
We provide an explicit $O(x/T)$ error term for the Riemann--von Mangoldt formula by making results of Wolke (1983) and Ramar\'e (2016) explicit. We also include applications to primes between
A New Method Around ABC Conjecture
This paper is the first in a series of four devoted to the abc conjecture, the Riemann Hypothesis, Fermat-Wiles Theorem and its extensions, Fermat Numbers and their generalizations. We propose here a
...
...

References

SHOWING 1-10 OF 19 REFERENCES
An improved upper bound for the argument of the Riemann zeta-function on the critical line
This paper concerns the function S(T), the argument of the Rie- mann zeta-function along the critical line. The main result is that |S(T)| � 0.111logT + 0.275 log logT + 2.450, which holds for all Te.
The distribution of prime numbers
Preface Introduction 1. Elementary theorems 2. The prime number theorem 3. Further theory of ( ). applications 4. Explicit formulae 5. Irregularities of distribution Bibliography.
Short effective intervals containing primes
The Theory of the Riemann Zeta-Function
The Riemann zeta-function embodies both additive and multiplicative structures in a single function, making it our most important tool in the study of prime numbers. This volume studies all aspects
Multiplicative Number Theory
From the contents: Primes in Arithmetic Progression.- Gauss' Sum.- Cyclotomy.- Primes in Arithmetic Progression: The General Modulus.- Primitive Characters.- Dirichlet's Class Number Formula.- The
On the Difference (x)--li(x) (I)
On a result of Littlewood concerning prime numbers
Sur la distribution des nombres premiers
Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
...
...