Skip to content

Erdős problem 272

Let N1N\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 AiAjA_i\cap A_j a non-empty arithmetic progression for all iji\neq j?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#272
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page