Back to Problems

erdos_200.variants.upper

Specification

It follows from the prime number theorem that such a progression has length $\leq(1+o(1))\log N$.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_200.variants.upper : ∃ (o : ℕ → ℝ) (_ : o =o[atTop] (1 : ℕ → ℝ)),
    ∀ n, longestPrimeArithmeticProgressions n ≤ (1 + o n) * log n
ID: ErdosProblems__200__erdos_200.variants.upper
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.