Skip to published state

Erdős problem / erdos

no open offer

Problem 200

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records

  1. vf_149752a453310e5d

    theoretical

    Erdős Problem #200: declared status 'open'. Formalized: yes. Does the longest arithmetic progression of primes in {1,…,N}\{1,\ldots,N\} have length o(log⁡N)o(\log N)? Prize: no. OEIS: A005115. Tags: arithmetic progressions, primes.

    recordedOpen record