Erdős Problem #425 — Let be the maximum possible size of a subset such that the products are distinct for all .
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
References
Primary source
Additional references
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.