Erdős Problem #377 — Is there some absolute constant C>0 such that ∑_p≤ n1_p mid binom2nn1/p≤ C for all n (where the summation is restricted to primes p≤ n)?
Statement
Is there some absolute constant such that for all (where the summation is restricted to primes )?
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.