The Brocard Conjecture and Primes in Small Intervals
Jan Feliksiak *
Edoo.pl Language School, Michaowski 11/8, 31-126 Krakow, Poland.
*Author to whom correspondence should be addressed.
Abstract
This paper presents the results of a research into the topic of the distribution of prime numbers in small intervals. The Brocard Conjecture asserts that the number of primes, within the interval, between the squares of two subsequent primes is:
\(\left(\pi_{p_{(n+1)}^{2}}-\pi_{p_{(n)}^{2}}\right) \geq 4 \quad \forall p_{n} \in \mathbb{N} \mid n \geq 2\) (0.1)
Although the number of primes within this interval varies to a great degree, there is a common ground, which makes it possible to settle this old conundrum. Three bounds are developed: the least lower bound and the lower/upper bounds. The least lower bound is implemented to prove the conjecture. The lower/upper bounds exploit the shortest such interval, namely between the twin primes. This has been done in order to establish the bounds, on the smallest number of primes within that interval. The research objective was not only to provide a true/false answer, but to clarify some aspects of the distribution of prime numbers within this interval as well. In addition to the weaker form of the Brocard Conjecture, the stronger one is also presented, as well as a couple others.
Keywords: Brocard conjecture, maximal prime gaps upper bound, prime number theorem, twin primes
How to Cite
Downloads
References
Feliksiak J. The Maximal Prime Gaps Supremum and the Firoozbakht's Hypothesis No 30;
Available: https://doi.org/10.20944/preprints202006.0366.v1
Riesel, H. Prime numbers and computer methods for factorization; 1994. Birkhauser
Feliksiak, Jan. Maximal prime gaps bounds. ScienceOpen; 2021.
Available: https://doi.org/10.14293/S2199-1006.1.SOR-.PPWVKRR.v1
Backlund RJ. Uber die Dierenzen zwischen den Zahlen, die zu den ersten n Primzahlen
teilerfremd sind. Commentationes in honorem Ernesti Leonardi Lindelof. Annales Acad. Sci.
Fenn. 1929; 32(2): 1-9.
Brauer A, Zeitz H. Uber eine zahlentheoretische Behauptung von Legendre, Sitzungsbericht.
Berliner Math. Ges. 1930; 29: 116-125.
Caldwell Chris K. The gaps between primes; 2006.
Available: http://primes.utm.edu/notes/gaps.html
Feliksiak; AJPAM, 4(3): 375-394, 2022; Article no.AJPAM.1058
Cramer Harald. On the order of magnitude of the dierence between consecutive prime
numbers. Acta Arithmetica; 1936.
Erdos, Pau. On the dierence of consecutive primes. Quarterly Journal Of Mathematics; 1935.
Erdos, Paul, Strauss EG. Remarks on the dierences between consecutive primes. Elem. Math.
; 35: 115-118.
Feliksiak, Jan. The elementary proof of the Riemann's Hypothesis. MDPI, AG; 2020.
Available: https://doi.org/10.20944/preprints202006.0365.v1
Hardy GH, Wright EM. An introduction to the theory of numbers. Oxford university press;
Heath-Brown, D.R. Dierences between consecutive primes. Jahresber. Deutsch. Mathem. Ver.
; 90: 71-89.
Nicely TR. Some results of computational research in prime numbers (Computational number
theory); 2009.
Available: http://www.trnicely.net
Pintz, Janos. Very large gaps between consecutive primes. Journal Of Number Theory; 1997.
Rankin, Robert A. The dierence between consecutive prime numbers. Journal London
Mathematical Society; 1938.
Shanks, Daniel. On maximal gaps between successive primes. Math. Comp. 1964; 18: 646-651.
Oliveira e Silva, Tomas. Gaps between consecutive primes; 2006. Available:
www.ieeta.pt/ tos/gaps.html
Soundararajan K. Small gaps between prime numbers: the work of Goldston-Pintz-Yildirim.
Bulletin of the American Mathematical Society; 2007.
Westzynthius E. Uber die Dierenzen Verteilung der Zahlen die zu den n ersten Primzahlen
teilerfremd sind. Comm. Phys. Math. Soc. Sci. Fenn. 1931;5: 1-37.