Reflected sieve counts at the primorial boundary
Let P_z be the product of the primes up to z. We study the smoothed error in counting integers coprime to P_z near P_z/z^a. For fixed 0 < a < 1, pairing complementary divisors transfers the growth exponent aΘ and two-sided oscillation of an unrestricted Möbius sum to the finite sieve count under the stated kernel hypotheses. Here Θ is the supremum of the real parts of the nontrivial zeros of the Riemann zeta function. At a = 1, primes exceeding z give a two-term expansion in z/log z and z/(log z)². Both coefficients are evaluated for Rayleigh smoothing. Rational enclosures give opposite signs for the signed error at z = 3,000,000 and z = 5,000,000. The accompanying archive contains the manuscript source, programs, data, instructions and Z3 inputs. Its 266 arithmetic checks cover specified identities and two primorial cases. The analytic theorems are presented with proofs in the paper. AI assistance: ChatGPT (OpenAI) suggested the complementary-divisor formulation and Rayleigh boundary calculations. It assisted in deriving and checking the Mellin, oscillation and unconditional estimates, the second boundary coefficient and the weighted prime-sum comparison. It identified the connection to Báez-Duarte, assisted with literature searches, wrote the computational and verification code, and contributed to drafting and editing the text. Gemini (Google) also assisted in preparatory work.
Authors
- MINKWON CHUNG
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24408484
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint