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?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:8e19789cb3d202cd3a376bf5ab0e93092b9baebd7c649dd3d2dbee947d33e770
Metadata
sha256:c7186a83248b7b2ef9d7670d174d302862b31bd622a1128e904e92c2ef9189dc
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:5897288e6b9f02abc9536e7c91b273fddf16634161354c11735b01c5b5d91d7f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page