The Proof of the Fermat-Beal Theorem

Abstract

It is easy to see that if then either are co-prime or, if not co-prime that any common factor could be divided out of each term until the equation existed with co-prime bases. (Co-prime is synonymous with pairwise relatively prime and means that in a given set of numbers, no two of the numbers share a common factor). You could then restate FLT by saying that is impossible with co-prime bases. (Yes, it is also impossible without co-prime bases, but non co-prime bases can only exist as a consequence of co-prime bases). II. THE FERMAT-BEAL THEOREM For all the equation