Computational Verification Dataset for Theorem 6.1 Minimal Gaps in Ghost Number Sequences
This dataset contains the computational verification of step deficits for all ghost numbers under 100. It provides the exact base-case calculations needed to complete the proof of Theorem 6.1, establishing that the minimal gap between non-trivial ghost numbers is exactly 4.
Authors
- Samuel Abel (ORCID: https://orcid.org/0009-0009-9547-8157)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-06-13
- DOI
- https://doi.org/10.5281/zenodo.20676875
- Primary Topic
- Benford’s Law and Fraud Detection
- Type
- article
- Field-Weighted Citation Impact
- 0.00