Last-Digit Filtering, Sliding Families and Run Lengths for Goldbach's Conjecture
Year: 2026
Type: article
Abstract: This paper processes a body of empirical material concerning Goldbach's conjecture: enumeration grouped by decimal last digit (ten digits → two → four), a sliding identity for numbers ending in 7, the exclusion of multiples of 5 by last digit, and the observation that "after some run of composites, a pair of primes finally appears." Following the verdict format of this series, each item is adjudicated one by one. Two are arithmetic facts with determinate truth values (the sliding identity, the exclusion of last digit 5); two acquire truth value only after rewriting (the basis for the grouping, the operational meaning of "consecutive composites"); and the universal form of one does not, unqualified, constitute a testable statement. On this basis the paper gives three computable formalisations: a last-digit pairing filter table (when both components are ≥ 10, the surviving last digits are only {1,3,7,9}, and each even last digit corresponds to 3–4 candidate last-digit pairs), a complete characterisation of the last-digit-7 sliding family, and a definition of the candidate-scan run length g(n). From these, three falsifiable hypotheses (H7–H9) are derived, together with a pre-registration-style verification protocol. All numerical values are machine-computed illustrative calculations (range given in §4), not experimental data, and constitute no proof. This paper explicitly does not claim to prove or disprove Goldbach's conjecture, and does not claim to have found a counterexample
Author: 曾乐,湖南耒阳
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236815680
