Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2304.00024

Empirical verification of a new generalisation of Goldbach's conjecture up to $10^{12}$ (or $10^{13}$) for all coefficients $\leq 40$

Zsófia Juhász·Máté Bartalos·Péter Magyar·Gábor Farkas
View original source ↗Read source document ↗Export metadata ↓

Abstract

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$ satisfying certain simple criteria can be expressed as $n=m_1p+m_2q$ for some primes $p$ and $q$. GGC is checked up to $10^{12}d$ for all (up to $10^{13}d$ for some) pairs of coefficients $m_1, m_2$, where $d=\gcd{(m_1, m_2)}$ and $m_1/d, m_2/d \leq 40$. The largest counterexamples found that cannot be obtained in this form are presented. Their relatively small sizes support the plausibility of GGC. Lemoine's conjecture is verified up to a new record of $10^{13}$. Four naturally arising verifying algorithms are described and their running times compared for every $m_1\leq m_2\leq 40$ relatively prime. These seek to find either the $p$- or the $q$-minimal $(m_1, m_2)$-partitions of all numbers tested, by either descending or ascending search for the prime to be maximised or minimised, respectively, in the partitions. For all $m_1, m_2$ descending searches were faster than ascending ones. A heuristic explanation is provided. The relative speed of ascending [descending] searches for the $p$- and for the $q$-minimal partitions, respectively, varied by $m_1, m_2$. Using the average of $p^*_{m_1, m_2}(n)$ - the minimal $p$ in all $(m_1, m_2)$-partitions of $n$ - up to a sufficiently large threshold, two functions of $m_1, m_2$ are introduced, which may help predict these rankings. Our predictions correspond well with actual rankings. These could be further improved by developing approximations to $p^*_{m_1, m_2}(n)$. Numerical data are presented, including average and maximum values of $p^*_{m_1, m_2}(n)$ up to $10^9$. An extension of GGC is proposed, generalising the Twin prime conjecture and the assertion that there are infinitely many Sophie Germain primes.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zsófia Juhász, Máté Bartalos, Péter Magyar, Gábor Farkas. 2023-03-31. Empirical verification of a new generalisation of Goldbach's conjecture up to $10^{12}$ (or $10^{13}$) for all coefficients $\leq 40$. https://arxiv.org/abs/2304.00024

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↗