Back to Problems

erdos_200

Specification

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

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem erdos_200 : answer(sorry) ↔
    (fun n => (longestPrimeArithmeticProgressions n : ℝ)) =o[atTop] (fun n => log n)
ID: ErdosProblems__200__erdos_200
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.