Skip to content

Erdős problem 272

Start work

Let N≥1N\geq 1. What is the largest tt such that there are A1,…,At⊆{1,…,N}A_1,\ldots,A_t\subseteq \{1,\ldots,N\} with Ai∩AjA_i\cap A_j a non-empty arithmetic progression for all i≠ji\neq j?

Sources

The source's own material, retained exactly.

4 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

272.lean

Retained formal statement1 of 4

Let N≥1N\geq 1. What is the largest tt such that there are A1,…,At⊆{1,…,N}A_1,\ldots,A_t\subseteq \{1,\ldots,N\} with Ai∩AjA_i\cap A_j a non-empty arithmetic progression for all i≠ji\neq j?

FormalConjectures/ErdosProblems/272.leanErdos272.erdos_2721 lineExact file
Asymptotics.IsEquivalent Filter.atTop (fun N => ↑(Erdos272.maxArithInterCard N)) sorry
OpenStatement only, no proof