lean_workbook_plus_52892
ProvedIf and are two prime numbers, such that divides and divides . prove that is not a prime.
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_52892 (p q : ℕ) (hp : p.Prime) (hq : q.Prime) (h : q ∣ q^2 + 1) (h' : p ∣ q^2 - 1) : ¬(p + q + 1).Prime := by sorry
Source