Erdős Problem #404 — For which integers a≥ 1 and primes p is there a finite upper bound on those k such that there are a=a_1<…<a_n with p^k | (a_1!+…+a_n!)? If f(a,p) is the greatest such k…
Statement
For which integers and primes is there a finite upper bound on those such that there are with If is the greatest such , how does this function behave? Is there a prime and an infinite sequence such that if is the highest power of dividing then ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.