Erdős problem 200Does the longest arithmetic progression of primes in {1,…,N}\{1,\ldots,N\} have length o(logN)o(\log N)?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 2003 retained source recordsCanvaspublic previewSource#200→ResultNone→Checks0