Erdős Problem #932 — Let p_k denote the kth prime.
Statement
Let denote the th prime. For infinitely many there are at least two integers all of whose prime factors are .
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.