lean_workbook_plus_46323

Proved

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

Prove that, for a positive integer $n$ and any integer $a$ , $gcd(a,a+n)$ divides $n$ ; hence $gcd(a,a+1)=1$

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_46323 (n a : ℤ) (hn : n > 0) : gcd a (a + n) ∣ n   :=  by sorry

Source