Erdős Problem #879 — Call a set S⊆ 1,…,n admissible if (a,b)=1 for all a≠ b∈ S.
Statement
Call a set admissible if for all . Let and Is it true that Is it true that, for every , if is sufficiently large then the admissible set which maximises contains at least one integer with at least prime factors?
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.