Erdős Problem #1106 — Let p(n) denote the partition function of n and let F(n) count the number of distinct prime factors of ∏_1≤ k≤ np(k). Does F(n)→ ∞ with n?
Statement
Let denote the partition function of and let count the number of distinct prime factors of Does with ? Is for all sufficiently large ?
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.