File(s) not publicly available
Beal's conjecture
Version 11 2018-04-02, 14:15
Version 10 2018-03-31, 20:51
Version 9 2018-03-29, 20:02
Version 8 2018-03-28, 17:10
Version 7 2018-03-26, 15:15
Version 6 2018-02-16, 22:09
Version 5 2018-02-14, 22:07
Version 4 2018-02-01, 14:33
Version 3 2018-01-29, 15:00
Version 2 2018-01-24, 21:48
Version 1 2018-01-19, 22:24
online resource
posted on 2018-04-02, 14:15 authored by Frank VegaFrank VegaWe 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.