Erdős Problem #535
Statement
Let , and let denote the size of the largest subset of such that no subset of size has the same pairwise greatest common divisor between all elements. Estimate .
Record
- Source
- Added
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.