← All problems

Erdős Problem #404 — Prime-power divisibility of factorial sums

46 years old · traced to

For an integer a≥1a\ge 1 and a prime pp, let K(a,p)K(a,p) be the set of positive integers kk for which some finite strictly increasing sequence of positive integers beginning with aa has factorial sum divisible by pkp^k:

K(a,p)={k≥1:∃n≥1, ∃a=a1<a2<⋯<an,pk∣∑j=1naj!}.K(a,p)=\left\{k\ge 1:\exists n\ge 1,\ \exists a=a_1<a_2<\cdots<a_n,\quad p^k\mid\sum_{j=1}^n a_j!\right\}.

For which pairs (a,p)(a,p) is K(a,p)K(a,p) bounded above? When K(a,p)K(a,p) has a greatest element, write f(a,p)=max⁡K(a,p)f(a,p)=\max K(a,p); how does f(a,p)f(a,p) behave? Erdős Problems #404

Separately, does there exist a prime pp and an infinite strictly increasing sequence of positive integers a1<a2<⋯a_1<a_2<\cdots such that, for every k≥1k\ge 1, the exponent

mk=vp ⁣(∑i=1kai!)m_k=v_p\!\left(\sum_{i=1}^k a_i!\right)

of the highest power of pp dividing the partial sum tends to infinity as k→∞k\to\infty? 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

Progress summary

Never refreshed

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.