Skip to content

Erdős problem 532

If N\mathbb{N} is 2-coloured then is there some infinite set A⊆NA\subseteq \mathbb{N} such that all finite subset sums∑n∈Sn \sum_{n\in S}n(as SS ranges over all non-empty finite subsets of AA) are monochromatic?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/532.lean

Formal Conjectures

FormalConjectures/ErdosProblems/532.leanErdos532.erdos_5321 lineExact file
True ↔ ∀ (c : ℕ → Fin 2), ∃ A, A.Infinite ∧ ∃ color, ∀ (S : Finset ℕ), S.Nonempty → ↑S ⊆ A → c (∑ n ∈ S, n) = color
SolvedProof has a holelean4external proof

The proof uses `sorry`: part of the argument is written but not proved. Lean accepts the file; it does not accept the theorem.

Proof manifests naming this Problem

  • Jayyhk Erdős Leanjayyhk:erdos:532
  • PLBY Lean proofsErdosProblems.Erdos532

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page