Erdős problem 195 · problems.science

What is the largest $k$ such that in any permutation of $\mathbb{Z}$ there must exist a monotone $k$ -term arithmetic progression $x_1 < \cdots < x_k$ ?

Sources

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

3 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

195.lean

Retained formal statement3 of 3

Geneson [Ge19] proved that k ≤ 5.

FormalConjectures/ErdosProblems/195.leanErdos195.erdos_195.variants.leq_5_bound1 lineExact file

15 ≥ sSup {k | ∀ (f : ℤ ≃ ℤ), HasMonotoneAP (⇑f) k}

SolvedStatement only, no proof

Sources

Search problems.science