DYADIC DEFICITS AND RADICAL AVERAGING FOR ERDŐS PROBLEM 373
We study the factorial Diophantine equation n! = a_1! a_2! ... a_r! in integers n - 1 > a_1 >= a_2 >= ... >= a_r >= 2 with r >= 2. Using a closed-form dyadic deficit inequality, we prove unconditionally that n - a_1 <= (log log n)/(log 2) + 0.90 for all n > 10^5 with n - a_1 >= 6 (and (log log n)/(log 2) - 0.34 for 6 <= n - a_1 <= 60), forcing n - a_1 in {2, 3, 4, 5} throughout 10^5 < n <= e^80. We also generalize Cooper and Preuss's modular non-existence theorems to arbitrary r >= 2, and establish an all-pairs radical averaging bound that streamlines the classification under Baker's explicit abc conjecture.
Authors
- Prince Anand (ORCID: https://orcid.org/0009-0004-1060-2045)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.5281/zenodo.24343982
- Primary Topic
- Algebraic Geometry and Number Theory
- Type
- preprint