Erdős Problem #126: prime divisors of pairwise sums
Statement
Let be maximal such that for every -element set ,
has at least distinct prime factors. Erdős asked whether
The answer is yes.
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.