Skip to content

Erdős problem 872

Each move claims exactly one pool element, so the minimax value never exceeds the number of already claimed elements plus the number of still unclaimed elements.

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/872.lean

Formal Conjectures

FormalConjectures/ErdosProblems/872.leanErdos872.erdos_872.parts.i1 lineExact file
True ↔ ∃ ε > 0, ∀ᶠ (n : ℕ) in Filter.atTop, ↑(Erdos872.L n) ≥ ε * ↑n
OpenStatement only, no proof

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

  • AI collaborating with humans

    Erdős AI contributions wiki · 16 Apr, 2026

    Machine
    GPT-5.4 Pro
    People
    Om_Buddhdev_sensho
    Open the source record

  • AI standalone

    Erdős AI contributions wiki · 16 Feb, 2026

    Machine
    GPT-5.2 Pro
    Open the source record

  • AI collaborating with humans

    Erdős AI contributions wiki · 29 Apr, 2026

    Machine
    GPT-5.5 Pro
    People
    Jonas Silva
    Open the source record

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page