Erdős problem 141

Let $k≥3$ . Are there $k$ consecutive primes in arithmetic progression?

Sources

The source's own material, retained exactly.

7 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

141.lean

Retained formal statement4 of 7

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

FormalConjectures/ErdosProblems/141.leanErdos141.erdos_141.variants.infinite_general_case1 lineExact file

1sorry ↔ ∀ k ≥ 3, (Erdos141.consecutivePrimeArithmeticProgressions k).Infinite

OpenStatement only, no proof