Valuation Freeze Trees and Polynomial Remainder Collapse for Sums of Distinct Factorials
Let A = {sum_{n in S} n! : S subset N_{>= 2} finite, non-empty}. Motivated by Erdős Problem #1108, we establish the Polynomial Remainder Collapse Identity P_J(n_1) ≡ B_J(T) (mod n_1 + T + 1), showing B_J(T) ≠ 0 for T ≠ 1 and B_J(T) ≡ 1 (mod p) whenever p | T. Using p-adic valuation freeze trees, we classify all pure powers of 2 in A (2^1, 2^3, 2^5, 2^7) across arbitrary subset cardinalities, prove v_2(sum_{n in S} n!) <= 254 for every S with min(S) = 2, and classify prefixes with min(S) in {3, 4, 5} up to N = 14 (12^2, 72^2). Finally, cyclotomic Lifting-the-Exponent bounds exclude all single-factorial extensions 2^k + n_2! = m^k (k in {3, 5, 7}), while fixed-cardinality and ABC-conditional finiteness are obtained for square-shifted extensions.
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.24332378
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint