Needs a steward / erdos-172
Steward erdos-172
Whether every finite colouring of the natural numbers has arbitrarily large finite sets all of whose distinct-element sums and products share one colour.
What the role asks
- Understand what the network proves on this problem.
- Write it up, and sign the explainer of the proof that closes it.
- Best efforts, no deadline: step down at any time.