Hindman's generalized conjecture on finite sums and products
Let and let a finite coloring of be given. Generalized Hindman's conjecture. There exist infinitely many such that all finite sums and all finite products formed using distinct elements from are monochromatic. This extends Hindman's sum-and-product problem from two variables to arbitrarily many selected elements; the supplied status evidence says that this conjecture remains open.
References
Primary source
Florian K. Richter, “Sums and products in sets of positive density”, arXiv:2507.00515 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 1
RemarkAI-assistedClaimed by OpenAI. For every finite coloring of the positive integers and every finite k>=1, the manuscript claims k distinct increasing integers whose nonempty subset sums and products all share one color. The smallest integer may exceed any prescribed cutoff, yielding infinitely many such finite tuples as asked on this page. This does not assert one infinite sequence whose sums and products are all monochromatic.See full solution
Claimed by OpenAI. For every finite coloring of the positive integers and every finite k>=1, the manuscript claims k distinct increasing integers whose nonempty subset sums and products all share one color. The smallest integer may exceed any prescribed cutoff, yielding infinitely many such finite tuples as asked on this page. This does not assert one infinite sequence whose sums and products are all monochromatic.
GitHub repository: https://github.com/openai/math
- OpenAI-164-01-Monochromatic-finite-sums-and-products-in-the-positive-integers.pdfOpen