OpenAI reports Hindman’s finite sums-and-products theorem
- Mathematics
For every finite coloring of the positive integers and every k≥1, some k-element set has all its nonempty subset sums and all its nonempty subset products in one color class.
OpenAI reports Hindman’s finite sums-and-products theorem
- Mathematics
For every finite coloring of the positive integers and every k≥1, some k-element set has all its nonempty subset sums and all its nonempty subset products in one color class.
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
For every finite coloring of the positive integers and every k≥1, some k-element set has all its nonempty subset sums and all its nonempty subset products in one color class.
Why it matters
If correct, resolves Hindman’s finite sums-and-products conjecture.
What counts as progress
Can one finite set have all its nonempty sums and products in the same color under any finite coloring?
Website timeline
Publication dates and editorial changes.