ARTICLE | doi:10.20944/preprints202107.0221.v1
Subject: Computer Science And Mathematics, Algebra And Number Theory Keywords: Infimum of the sum of log p terms squared; Supremum of the sum of log p terms squared; Lower and Upper bounds on the sum of log p terms squared
Online: 9 July 2021 (13:17:02 CEST)
In this research paper, we implement the theory of the primorial function, to develop the Supremum and Infimum bounds for the sum of (log(p))2. There are, however, considerable computational difficulties related to these bounds. Therefore, from a pragmatic point of view, a set of Upper and Lower bounds had been developed to bypass this issue. Despite the increased estimation error, the Upper and Lower bounds are still considered sufficiently accurate, while facilitating an easy and fast computation of the estimate of the sum.
ARTICLE | doi:10.20944/preprints202109.0097.v1
Subject: Computer Science And Mathematics, Algebra And Number Theory Keywords: Prime counting function Supremum/Infimum; prime numbers distribution; Ramanujan Interval; Ramanujan primes
Online: 6 September 2021 (13:21:06 CEST)
The Ramanujan primes are the least positive integers Rn having the property that if m ≥ Rn, then πm − π(m/2) ≥ n. This document develops several bounds related to the Ramanujan primes, sharpening the currently known results. The theory presented is by no means exhaustive, however it provides insights for future research work. Alternatively, we may say that it is a road map which may be followed to make further discoveries.
ARTICLE | doi:10.20944/preprints202006.0365.v2
Subject: Computer Science And Mathematics, Algebra And Number Theory Keywords: Cramer`s conjecture; distribution of primes; elementary proof of the Riemann's Hypothesis; Landau problems; Legendre conjecture; Littlewood`s proof of 1914; logarithmic integral; maximal prime gaps; Prime Number Theorem; Tailored logarithmic integral; prime counting function Supremum; prime counting function Infimum.
Online: 6 July 2021 (11:32:03 CEST)
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.
ARTICLE | doi:10.20944/preprints202006.0366.v1
Subject: Computer Science And Mathematics, Algebra And Number Theory Keywords: Cramer's conjecture; elementary proof; Firoozbakht's conjecture; Farideh Firoozbakht; Legendre conjecture; maximal prime gaps Supremum; prime gaps
Online: 30 June 2020 (10:32:40 CEST)
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.