Erdős Problem #912 — If n! = ∏_i p_i^k_i is the factorisation into distinct primes then let h(n) count the number of distinct exponents k_i.
Statement
If is the factorisation into distinct primes then let count the number of distinct exponents . Prove that there exists some such that as .
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.