lean_workbook_plus_8277
DisprovedIf none of the three numbers is divisible by , prove that is divisible by by considering cases where and are congruent to modulo , or congruent to and , or congruent to and modulo .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_8277 : ∀ a b : ℤ, ¬ 5 ∣ a ∧ ¬ 5 ∣ b → a^3 * b - a * b^3 ≡ 0 [ZMOD 10] := by sorry
Source