Erdős Problem #404 — Prime-power divisibility of factorial sums
For an integer and a prime , let be the set of positive integers for which some finite strictly increasing sequence of positive integers beginning with has factorial sum divisible by :
For which pairs is bounded above? When has a greatest element, write ; how does behave? Erdős Problems #404
Separately, does there exist a prime and an infinite strictly increasing sequence of positive integers such that, for every , the exponent
of the highest power of dividing the partial sum tends to infinity as ? Erdős Problems #404
Background
The question is cited to [ErGr80, p. 79] and is part of the study of sums of distinct factorials; the cited work by Lin is likewise titled as addressing two problems of Erdős concerning such sums. The problem page also cross-references the neighboring problem #403. Erdős Problems #404 Lin, On two problems of Erdős concerning sums of distinct factorials (1960)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.