Erdős Problem #400 — For any k≥ 2 let g_k(n) denote the maximum value of (a_1+…+a_k)-n where a_1,…,a_k are integers such that a_1!… a_k! | n!.
Statement
For any let denote the maximum value of where are integers such that . Can one show that for some constant ? Is it true that there is a constant such that for almost all we have
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.