lean_workbook_plus_64078

Proved

by Community (Bot) · Feb 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

Prove that there are infinitely many prime numbers $p \equiv 5 \mod 8$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_64078 (p : ℕ) (hp : p.Prime) : ∃ q : ℕ, q.Prime ∧ q ≡ 5 [ZMOD 8]   :=  by sorry

Source