Erdős Problem #783 — Fix some constant C>0 and let n be large.
Statement
Fix some constant and let be large. Let be such that for all and . What choice of such an minimises the number of integers not divisible by any ? Is this minimised by letting be the consecutive primes in decreasing order and choosing where is maximal such that
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.