Preprint
Article

This version is not peer-reviewed.

Restricted Goldbach Sums in Arithmetic Progressions II: Almost-All Theorems and a Shifted-Prime Limit Law

Submitted:

19 November 2026

Posted:

20 November 2026

You are already at the latest version

Abstract
For \( q \) ≥ 1 and \( gcd(a,q) \) = 1 we study the restricted weighted Goldbach sum \( R_{a,q}(N)=\sum_{p_{1}+p_{2}=N,\; p_{1}\equiv a\; (q)} (logp_{1})(logp_{2}) \) over primes. If an odd prime l divides \( q \), then \( R_{a,q}(N)=O_{q}(logN) \) on the even \( N≡a (mod \ell) \), a set of density 1/\( \ell \), so the main term must be corrected there. For \( q=2^{k} \) we prove by the circle method a mean-square estimate with an arbitrary power-of-logarithm saving, hence an exceptional set of size \( O_{A,q}(X(logX)^{-A}) \), and an asymptotic formula for the restricted ternary sum. For general \( q \) the corrected almost-all theorem is proved conditionally on a mean-value theorem of Tolev. Along shifted primes \( p+h \), the odd part of the singular series converges in distribution to an explicit random Euler product \( Y_{h} \), and for \( q=2^{k} \) and odd h the normalised sum \( \varphi (q)R_{a,q}(p+h)/(2C_{2}(p+h)) \) has the same limit. The constants from the Siegel–Walfisz theorem are ineffective; the paper proves neither Goldbach’s conjecture nor finiteness of any exceptional set, and its numerical statements are finite-range observations.
Keywords: 
;  ;  ;  ;  ;  ;  
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.