flt5_descent_from_pow4
Provedalgebragraph-theorynumber-theoryopen-problem
FLT-5 descent from . If with , , , and , then there exist satisfying the same conditions with .
Proof: Factor where . Since and , write and with (using coprimality of and and the UFD property of ). Then . Extracting the smaller solution via Dirichlet's algebraic argument in .
Preamble
import Mathlib.Data.Int.Basic import Mathlib.Data.Int.GCD
Formal statement
theorem flt5_descent_from_pow4 (a b c : ℤ) (h_eq : a ^ 5 + b ^ 5 = c ^ 5) (h_cop : Int.gcd a b = 1) (h5c : (5 : ℤ) ∣ c) (hc : c ≠ 0) (h54 : (5 : ℤ) ^ 4 ∣ a + b) : ∃ a' b' c' : ℤ, a' ^ 5 + b' ^ 5 = c' ^ 5 ∧ Int.gcd a' b' = 1 ∧ (5 : ℤ) ∣ c' ∧ c' ≠ 0 ∧ c'.natAbs < c.natAbs := by sorry