Skip to content

Erdős Problem #172

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: additive combinatorics, ramsey theory.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

The question in plain language

Colour the positive integers with finitely many colours. Erdős #172 asks whether, for arbitrarily large finite sets \(A\) of distinct positive integers, one can make all finite sums and all finite products of distinct members of \(A\) have the same colour.

For \(A=\{a_1,\ldots,a_m\}\), the natural strengthened interpretation is that every nonempty subset \(I\subseteq\{1,\ldots,m\}\) contributes both

\[ \sum_{i\in I}a_i \quad\text{and}\quad \prod_{i\in I}a_i, \]

and all these values have one common colour. Clarify whether singleton subsets are required when comparing historical formulations; the current maintained page leaves “all sums and products of distinct elements” abbreviated.

A small example

Take \(A=\{2,3\}\). Its pair sum is \(5\) and pair product is \(6\), so the question for a two-element set demands that these values share a colour. Under the nonempty-subsets interpretation, the singleton values \(2\) and \(3\) must share that colour too. The latter is a strictly stronger finite fixture than checking \(5\) and \(6\) alone.

Requiring arbitrarily large finite \(A\) does not imply the existence of one infinite \(A\) with the same property: the finite witnesses can depend on the requested size.

What is known

The problem over the positive integers remains OPEN. Hindman (1980) gave a seven-colouring showing that the infinite-set variant is false. Moreira (2017) proved that every finite colouring of the positive integers admits \(x,y\) for which \(x\), \(x+y\) and \(xy\) have the same colour, a special configuration substantially weaker than arbitrarily large finite sets.

Ryan Alweiss, Monochromatic Sums and Products over \(\mathbb Q\) (2023), proves the corresponding arbitrarily large finite subset-sum and subset-product assertion for finite colourings of the nonzero rationals. A result over \(\mathbb Q\setminus\{0\}\) does not by itself imply one over \(\mathbb N\): its witnesses may be negative or fractional. Bowen and Sabok obtained the two-element rational case earlier.

GCL's current state

The pinned and maintained #172, updated April 2026, classify the integer problem OPEN. Original issue: #1441. The protected Formal Conjectures statement exists; a statement file alone gives neither proof nor automatic semantic equivalence for singleton and positivity conventions.

The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.

What remains

A bounded successor extracts the exact historical definition, then enumerates all sums and products of nonempty distinct-element subsets for finite example sets. Acceptance: a shared colour is checked across both operations, singleton inclusion is explicit, integers are positive, and the rational theorem is labelled as a different ambient domain, not a solved integer case.

Sources and claim boundaries

No positive-integer theorem, original-Hindman proof replay or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1441 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction