Journal of Economic Intelligence and Mathematics

DOI PREFIX 10.67238
FREQUENCY Annual (One issue per year)
×

Contact Emails

mathematics@globalmeetx.net
support@globalmeetx.com
editorial@globalmeetx.com
finance@globalmeetx.com

Unconditional Bound on the Exceptional Set for the Restricted Binary Goldbach Problem Above 1019.9: A Rigorous Combination of the Almost-All Theorem and the GRH Threshold

Review Article - Volume: 1, Issue: 1, 2026 (October)
Ibar Federico Anderson*

Universidad Nacional de La Plata La Plata, República Argentina

*Correspondence to: Ibar Federico Anderson, Universidad Nacional de La Plata La Plata, República Argentina, E-Mail:
Received: June 25, 2026; Manuscript No: JEIM-26-2067; Editor Assigned: July 06, 2026; PreQc No: JEIM-26-2067(PQ); Reviewed: August 18, 2026; Revised: August 28, 2026; Manuscript No: JEIM-26-2067(R); Published: October 15, 2026

ABSTRACT

We establish the strongest unconditional consequence of combining two recent results of the author on the restricted weighted Goldbach sum

Ra,q(N) := ∑p1+p2=Np1≡a (mod q)(logp1)(logp2),  Ma,q(N) := C2 S(N)φ(q) N,

where C2=0.6601618… is the twin-prime constant and S(N) is the binary singular series. Paper (unconditional) proves an almost-all bound: the number of even N≤X for which |Ra,q(N)−Ma,q(N)|>C(A,q) N(logN)−3 is at most E1(A,q) X(logX)−A, with the explicit constant K:=2C(1,4)≤38.02. Paper(conditional on GRH) proves that Ra,q(N)>0 for every even N≥N0(4) with logN0(4)=45.93 (Normalisation B), i.e. N0(4)≈1019.9; the certified worst-case bound is logN0(4)≤46.1.

We prove three results. (I) (Structural obstruction, unconditional) Combining the two papers to obtain Ra,4(N)>0 for every even N≥1019.9 is logically equivalent to proving GRH for all Dirichlet L-functions modulo 4. This barrier is structural, not a deficiency of the proofs. (II) (Main theorem, unconditional) For q=4, a∈{1,3}, any A>0, and all X≥max(1020,e47),

#{N∈[1019.9,X] : N  even, Ra,4(N)=0} ≤ E1(A,4) X(logX)A,

where E1(A,4) is effectively computable; for A=1 the fraction of potential counterexamples among all even integers in [1019.9,X] is at most E1(1,4)/logX→0. (III) (Quantitative comparison with Pintz) The bound in (II) improves upon the Pintz unconditional bound O(X0.72)  in relative density over [1019.9,X]: the exceptional set is OA(X(logX)−A) for every A>0, which is smaller than any fixed power of X in the relative sense.

This paper does not prove the Goldbach conjecture, does not prove GRH, and does not prove that every specific even N≥1019.9 is a Goldbach sum. The exceptional set is shown to have density zero but may be infinite. The result is the strongest unconditional statement extractable from the combination of and .

May 2026

Keywords: Goldbach problem; restricted Goldbach sum; arithmetic progressions; almost-all theorem; exceptional set; GRH threshold; Dirichlet L-functions; Montgomery–Vaughan theorem; Pintz bound; explicit constants; circle method.

MSC 2020: 11P32, 11N13, 11M26.


Citation: Anderson IF (2026).

Unconditional Bound on the Exceptional Set for the Restricted Binary Goldbach Problem Above 1019.9: A Rigorous Combination of the Almost-All Theorem and the GRH Threshold

. J. Econ. Intell. Math.. Vol.1 Iss.1, October (2026), pp:41-48.

Copyright: © 2026 Ibar Federico Anderson. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.