Erdős Problem #425 — Let F(n) be the maximum possible size of a subset A⊆1,…,N such that the products ab are distinct for all a<b.
Statement
Let be the maximum possible size of a subset such that the products are distinct for all . Is there a constant such that If is such that all products are distinct for then is it true 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.