prime gaps
Recently Published Documents


TOTAL DOCUMENTS

31
(FIVE YEARS 3)

H-INDEX

5
(FIVE YEARS 0)

Author(s):  
Jan Feliksiak

This research paper aims to explicate the complex issue of the Riemann's Hypothesis and ultimately presents its elementary proof. The method implements one of the binomial coefficients, to demonstrate the maximal prime gaps bound. Maximal prime gaps bound constitutes a comprehensive improvement over the Bertrand's result, and becomes one of the key elements of the theory. Subsequently, implementing the theory of the primorial function and its error bounds, an improved version of the Gauss' offset logarithmic integral is developed. This integral serves as a Supremum bound of the prime counting function Pi(n). Due to its very high precision, it permits to verify the relationship between the prime counting function Pi(n) and the offset logarithmic integral of Carl Gauss. The collective mathematical theory, via the Niels F. Helge von Koch equation, enables to prove the RIemann's Hypothesis conclusively.


Author(s):  
Jan Feliksiak

This research paper discusses the distribution of prime numbers, from the point of view of the Nicholson's conjecture of 2013. The proof of the conjecture, permits to develop and establish a Supremum bound, on the difference of terms of the conjecture. Nicholson's conjecture belongs to the class of the strongest bounds on maximal prime gaps.


Author(s):  
Jan Feliksiak

This paper presents research results, pertinent to the maximal prime gaps bounds. Four distinct bounds are presented: Upper bound, Infimum, Supremum and finally the Lower bound. Although the Upper and Lower bounds incur a relatively high estimation error cost, the functions representing them are quite simple. This ensures, that the computation of those bounds will be straightforward and efficient. The Lower bound is essential, to address the issue of the value of the lower bound implicit constant C, in the work of Ford et al (Ford, 2016). The concluding Corollary in this paper shows, that the value of the constant C does diverge, although very slowly. The constant C, will eventually take any arbitrary value, providing that a large enough N (for p <= N) is considered. The Infimum/Supremum bounds on the other hand are computationally very demanding. Their evaluation entails computations at an extreme level of precision. In return however, we obtain bounds, which provide an extremely close approximation of the maximal prime gaps. The Infimum/Supremum estimation error gradually increases over the range of p and attains at p = 18361375334787046697 approximately the value of 0.03.


Author(s):  
Jan Feliksiak

The maximal prime gaps upper bound problem is one of the major mathematical problems to date. The objective of the current research is to develop a standard which will aid in the understanding of the distribution of prime numbers. This paper presents theoretical results which originated with a researchin the subject of the maximal prime gaps. the document presents the sharpest upper bound for the maximal prime gaps ever developed. The result becomes the Supremum bound on the maximal prime gaps and subsequently culminates with the conclusive proof of the Firoozbakht's Hypothesis No 30. Firoozbakht's Hypothesis implies quite a bold conjecture concerning the maximal prime gaps. In fact it imposes one of the strongest maximal prime gaps bounds ever conjectured. Its truth implies the truth of a greater number of known prime gaps conjectures, simultaneously, the Firoozbakht's Hypothesis disproves a known heuristic argument of Granville and Maier. This paper is dedicated to a fellow mathematician, the late Farideh Firoozbakht.


Author(s):  
Jan Feliksiak

This research paper aims to explicate the complex issue of the Riemann's Hypothesis and ultimately presents its elementary proof. The method implements one of the binomial coefficients, to demonstrate the maximal prime gaps bound. Maximal prime gaps bound constitutes a comprehensive improvement over the Bertrand's result, and becomes one of the key elements of the theory. Subsequently, implementing the theory of the primorial function and its error bounds, an improved version of the Gauss' offset logarithmic integral is developed. This integral serves as a Supremum bound of the prime counting function Pi(n). Due to its very high precision, it permits to verify the relationship between the prime counting function Pi(n) and the offset logarithmic integral of Carl Gauss. The collective mathematical theory, via the Niels F. Helge von Koch equation, enables to prove the RIemann's Hypothesis conclusively.


2020 ◽  
Vol 102 (1) ◽  
pp. 99-124
Author(s):  
Jori Merikoski
Keyword(s):  

2019 ◽  
Vol 94 (3) ◽  
pp. 533-568 ◽  
Author(s):  
Emanuel Carneiro ◽  
Micah Milinovich ◽  
Kannan Soundararajan
Keyword(s):  

Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 691
Author(s):  
Visser

The Firoozbakht, Nicholson, and Farhadian conjectures can be phrased in terms of increasingly powerful conjectured bounds on the prime gaps g n : = p n + 1 - p n . While a general proof of any of these conjectures is far out of reach, I shall show that all three of these conjectures are unconditionally and explicitly verified for all primes below the as yet unknown location of the 81st maximal prime gap, certainly for all primes p < 2 64 . For the Firoozbakht conjecture itself this is a rather minor improvement on currently known results, but for the somewhat stronger Nicholson and Farhadian conjectures this may be considerably more interesting. Sequences: A005250 A002386 A005669 A000101 A107578 A246777 A246776.


2018 ◽  
Vol 13 (2) ◽  
pp. 652-662
Author(s):  
Luan Alberto Ferreira ◽  
Hugo Luiz Mariano
Keyword(s):  

2018 ◽  
Vol 184 (4) ◽  
pp. 413-418 ◽  
Author(s):  
János Pintz
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document