lean_workbook_plus_22858

Proved

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

Prove: For all positive integers $c$ , we can find 2 numbers $a$ and $b$ , $gcd(a,b)=1$ , such that there are infinitely many positive integers $n$ , satisfy $cn+1 \mid a^n-b^n$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_22858 (c : ℕ) : ∃ a b : ℕ, Nat.Coprime a b ∧ ∀ n : ℕ, 0 < n → c*n+1 ∣ a^n-b^n   :=  by sorry

Source

https://huggingface.co/datasets/internlm/Lean-Workbook

View graph