Complete modulus locking in the exceptional set of the abc conjecture
Let N_λ(X) count primitive positive triples a+b=c ≤ X with rad(abc) < c^λ. We prove, using inherited anatomic estimates and a new finite exact-rational implication, that N_λ(X) ≪ X^{U+ε} for 0 < λ ≤ 1, where U = 11680007/20000012 < 73/125 = 0.584. The new arithmetic-computational step exhausts all third-letter whole-value modulus sets: index 1 is eliminated by a one-Lipschitz argument, leaving 32 subsets of {2,3,4,5,6}, and grouped power-difference bounds are used in every fixed degree 2 ≤ e ≤ 6. A branch-and-bound tree with 65,576 leaves is verified by an independent standard-library checker which reconstructs every inequality and checks every rational multiplier; floating-point linear programming is used only to discover the tree. We also prove that the enlargement is mathematically essential, not merely a faster solver: an explicit rational point feasible for the old modulus family has D = 403/690, whereas FullOC gives the collision bound 53/92 at the same point, and a second explicit point gives 7/12 ≤ D*_{FullOC}. These are statements about exponent programs, not lower bounds for abc triples. No assertion of abc, Szpiro, finiteness of the exceptional set, or an Arakelov degeneration functor is made.
Authors
- Chunping Zeng
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.5281/zenodo.24354213
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint