Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2002.07174

The importance of finding the upper bounds for prime gaps in order to solve the twin primes conjecture and the Goldbach conjecture

Andrea Berdondini
View original source ↗Read source document ↗Export metadata ↓

Abstract

ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a procedure for the determination of the upper bounds for prime gaps different from the most famous and known approaches. The proposed method analyzes the distribution of prime numbers using the set of relative numbers. Using negative numbers too, it becomes intuitive to understand that that the arrangement of 2P+1 consecutive numbers that goes -P to P, is the only arrangement that minimizes the distance between two powers having the same absolute value of the base D, with |D|<=P. This arrangement is considered important because by increasing the number of powers of the prime numbers within a range of consecutive numbers, it is presumed to decrease the overlap between the prime numbers considered. Consequently, by reducing these overlaps, we suppose to obtain an arrangement, in which the prime numbers less than and equal to P and their multiples occupy the greatest possible number of positions within a range of 2P+1 consecutive numbers. If this result could be demonstrated, would imply not only the resolution of the Legendre conjecture, but also a step forward in the resolution of the twin primes conjecture and the Goldbach conjecture.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Andrea Berdondini. 2020-02-17. The importance of finding the upper bounds for prime gaps in order to solve the twin primes conjecture and the Goldbach conjecture. https://arxiv.org/abs/2002.07174

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗