/-
Copyright 2025 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
import FormalConjecturesUtilBeal conjecture
Reference: Wikipedia
namespace BealConjecturedef bealConjecture : Prop := ∀ {A B C x y z : ℕ},
A ≠ 0 → B ≠ 0 → C ≠ 0 → 2 < x → 2 < y → 2 < z →
A^x + B^y = C^z → 1 < Finset.gcd {A, B, C} idThe Beal Conjecture: if we are given positive integers $A, B, C, x, y, z$ such that $x, y, z > 2$ and $A^x + B^y = C^z$ then $A, B, C$ have a common divisor.
@[category research open, AMS 11]
theorem beal_conjecture : bealConjecture := ⊢ bealConjecture
All goals completed! 🐙The Beal Conjecture implies Fermat's last theorem
All goals completed! 🐙end BealConjecture