Back to Problems

erdos_141.variant.infinite_general_case

Specification

Fix a $k \geq 3$. Is it true that there are infinitely many arithmetic prime progressions of length $k$?

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_141.variant.infinite_general_case : answer(sorry) ↔
    ∀ k ≥ 3, (consecutivePrimeArithmeticProgressions k).Infinite
ID: ErdosProblems__141__erdos_141.variant.infinite_general_case
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.