Erdős problem 272Let 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?WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 2725 retained source recordsCanvaspublic previewSource#272→ResultNone→Checks0