∑math20

Combinatorics · Result 164

Hindman’s finite sums and products conjecture

1 paper

Proves Hindman's finite sums and products conjecture: every finite coloring of the positive integers contains sets of any prescribed finite size whose nonempty subset sums and nonempty subset products all have one common color.

Watch

▶Introduction: the problem and why it mattersin preparation
▶The presented solutionin preparation

Papers 1

First page of Monochromatic finite sums and products in the positive integers

Monochromatic finite sums and products in the positive integers

OpenAI · September 23, 2026

We prove Hindman's finite sums and products conjecture: for every finite coloring of the positive integers and every positive integer k, there is a k-element set whose nonempty subset sums and nonempty subset products all have the same color.

Read PDF Download Source

Cite
@misc{OAI:Monochromatic-finite-sums-and-products-in-the-positive-integers-September-23-2026,
  author = {{OpenAI}},
  title = {{Monochromatic finite sums and products in the positive integers}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Monochromatic-finite-sums-and-products-in-the-positive-integers-September-23-2026/paper.pdf}{OAI:Monochromatic-finite-sums-and-products-in-the-positive-integers-September-23-2026}},
  year = {2026}
}

Formal verification

No Lean formalization is listed for this result yet. The repository notes that unformalized results could have issues.