Erdős Problem #983 — Let n≥ 2 and π(n)<k≤ n.
Statement
Let and . Let be the smallest integer such that in any of size there exist primes such that many are only divisible by primes from . Is it true that as ? In general, estimate , particularly when .
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.