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$ ?

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/195.lean

Formal Conjectures

FormalConjectures/ErdosProblems/195.leanErdos195.erdos_1951 lineExact file

1sorry = sSup {k | ∀ (f : ℤ ≃ ℤ), HasMonotoneAP (⇑f) k}

OpenStatement only, no proof

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Continue

Search problems.science