Erdős problem 872 · problems.science

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.

Sources

Browse retained paths and inspect the exact material available for this Problem.

6 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

872.lean

Retained formal statement3 of 6

A trivial upper bound: a play can claim at most the $n - 1$ elements of $\{2, \dots, n\}$ , so $L(n) \leq n - 1$ .

FormalConjectures/ErdosProblems/872.leanErdos872.erdos_872.trivial_upper_bound1 lineExact file

1∀ (n : ℕ), 2 ≤ n → Erdos872.L n ≤ n - 1

TextbookStatement only, no proof

Sources

Search problems.science