Skip to content

Erdős problem 200

Start work

Does the longest arithmetic progression of primes in {1,…,N}\{1,\ldots,N\} have length o(log⁡N)o(\log N)?

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal2 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Open the source record
Where the source files it83 share a topic
Primes61Arithmetic Progressions27
None carries a Standing. Browse the topic.
Start workOpen sources