Work

Five Consecutive Catalan–niven Numbers: a Refutation of Eldar's Conjecture and Quantitative Bounds

Year: 2026
Type: preprint
Abstract: Eldar conjectured in 2022 that no five consecutive integers are Catalan–Nivennumbers, meaning that each integer is divisible by the weight of its greedy Catalan rep-resentation. We refute the conjecture with a run beginning at 26 153 987 720 924. Writ-ing R5(X) for the number of five-term starts at most X and Z = log log X, we prove,above an effective threshold, R5(X) ≥ exp((Z/16) exp √Z/8000). In the opposite direction,R5(X) = O(X(log log X)5/(log X)5), so these starts have natural density zero. The lowerbound combines a local carry pattern, distinct-index modular correction and finite Fouriercoverage by carry-free digits. The upper bound uses fixed greedy prefixes and Chinese remain-der compatibility of the five weights. An explicit six-term correction also gives a family withcounting function asymptotic to (log X)340/(340!(log 4)340). Complete proofs and reproduciblefinite-arithmetic checks are provided.
Author: Newton, Tony
Language: English
Open Access status: green
OpenAlex ID: W7236566177
Cites:
Cited by:
Related to: 10