Erdős Problem #1062 — Let f(n) be the size of the largest subset A⊆ 1,…,n such that there are no three distinct elements a,b,c∈ A such that a| b and a| c. How large can f(n) be?
Statement
Let be the size of the largest subset such that there are no three distinct elements such that and . How large can be? Is irrational?
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.