%0 Web Page %A Vega, Frank %D 2018 %T Beal's conjecture %U https://figshare.com/articles/online_resource/The_Beal_s_Conjecture_Answer/5807385 %R 10.6084/m9.figshare.5807385.v11 %K Reductio ad absurdum %K Fermat's Last Theorem %K Divisibility %K Factor Number %K Algebra and Number Theory %X We prove if $A^{x} + B^{y} = C^{z}$, where $A$, $B$, $C$, $x$, $y$ and $z$ are positive integers, $x$, $y$ and $z$ are all greater than $2$, then $A$, $B$ and $C$ must have a common prime factor. In this way, we demonstrate the Beal's conjecture using the properties of divisibility and applying the reductio ad absurdum. %I figshare