Erdős problem 142 · problems.science

Prove an asymptotic formula for $r_k(N)$ , the largest possible size of a subset of $\{1, \dots, N\}$ that does not contain any non-trivial $k$ -term arithmetic progression.

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/142.lean

Formal Conjectures

FormalConjectures/ErdosProblems/142.leanErdos142.erdos_1421 lineExact file

1∀ (k : ℕ), (fun N => ↑(Erdos142.r k N)) =Θ[Filter.atTop] sorry

OpenStatement only, no proof

Reported activity

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

Valid but non-improving proofs
GPT-Erdős
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Reported activity

Continue

Search problems.science