lean_workbook_plus_75408

Proved

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

Let $a, b$ , and $c$ be integers such that $a+b+c$ divides $a^2 +b^2 +c^2$ . Prove that there are infinitely many positive integers $n$ such that $a+b+c$ divides $a^n +b^n +c^n$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_75408 (a b c : ℤ) (h : a+b+c ∣ a^2 + b^2 + c^2) : ∃ n : ℕ, a+b+c ∣ a^n + b^n + c^n   :=  by sorry

Source

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

View graph