English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A new generalisation of Goldbach's conjecture (GGC) - also generalising thatof Lemoine - is tested, introduced by the first author. It states that forevery 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$ forsome 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 thatcannot be obtained in this form are presented. Their relatively small sizessupport the plausibility of GGC. Lemoine's conjecture is verified up to a newrecord of $10^{13}$. Four naturally arising verifying algorithms are describedand their running times compared for every $m_1\leq m_2\leq 40$ relativelyprime. These seek to find either the $p$- or the $q$-minimal $(m_1,m_2)$-partitions of all numbers tested, by either descending or ascendingsearch for the prime to be maximised or minimised, respectively, in thepartitions. For all $m_1, m_2$ descending searches were faster than ascendingones. 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 sufficientlylarge threshold, two functions of $m_1, m_2$ are introduced, which may helppredict 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, generalisingthe Twin prime conjecture and the assertion that there are infinitely manySophie Germain primes.

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