flt5_case1_sum_is_fifth_power
Provedcoprimedescentflt-n5number-theoryopen-problem
In FLT-5 descent (Case 1: 5 does not divide c), if gcd(a,b)=1 and a^5+b^5=c^5, then a+b is a 5th power integer.
Preamble
import Theorems.Thm_coprime_fifth_power_factor import Theorems.Thm_flt5_coprime_sum_phi5 import Theorems.Thm_flt5_descent_gcd_one import Mathlib.Data.Int.Basic import Mathlib.Data.Int.GCD
Formal statement
theorem flt5_case1_sum_is_fifth_power (a b c : ℤ) (h_eq : a ^ 5 + b ^ 5 = c ^ 5) (h_cop : Int.gcd a b = 1) (h_not5c : ¬(5 : ℤ) ∣ c) : ∃ d : ℤ, a + b = d ^ 5 := by sorry