----------------
By conditions of Beal Conjecture A, B & C are
positive integers > 0. Which implies
A^x + B^y > 1^z
Therefore for valid terms in Beal Conjecture C^z = A^x + B^y,
C must be integer > 1
positive integers > 0. Which implies
A^x + B^y > 1^z
Therefore for valid terms in Beal Conjecture C^z = A^x + B^y,
C must be integer > 1
i,e. C = integer 2 or more
Therefore C^z is a composite integer
Therefore C^z is a composite integer
----------------
[2B] LEASET value of VALID Term of C^z, A & B
in BEAL CONJECTURE C^z = A^x + B^y
-------------------
We verified above in [2A]
for BEAL CONJECTURE C in C^z must be integer 2 or more,
Also
for Beal Conjecture z must be +ve integer > 2
Therefore for Beal conjecture value of C^z = 2^3 or more
Which implies for Beal Conjecture
1^x + 1^y > C^z
Therefore for Beal conjecture value of C^z = 2^3 or more
Which implies for Beal Conjecture
1^x + 1^y > C^z
since 1^x + 1^y = 2 & C^z = 2^3 or more
A & B can't be simultaneously = 1
A & B can't be simultaneously = 1
which implies A & B are integers > 1 = 2 or more
------------------
Also it is already proved that for,
Q^n = P^m + 1 where P,Q, m, & n are positive integers,
the only solution is 3^2 = 2^3 + 1 [Proved by Preda Mihailescu for Catalan Conjecture]
But equation 3^2 = 2^3 +1 is invalid equation for Beal Conjecture as x, y & z must be integers > 2
[2C ] Therefore for valid terms in Beal Conjecture C^z = A^x + B^y,
C, A & B are integers > 1 = 2 or more.
Which implies in BEAL Conjecture C^z = A^x + B^y
C^z, A^x & B^y are COMPOSITE INTEGERS
------------------------------------
Least Value for C^z = 2^3 = 8
Similarly,
For Skeletal Expression of C^z = C^2 + C^2 + C^2 + ...... ...... ......... up to C^(z-2) Number of Unit Terms
C^z = N*U = [C^2]*[C^(z-2)]
where value of Unit Term U = C^2 & Number of Unit terms N = C^(z-2)
Least Value for C^2 = 4 &
Least Value for C^(z-2) = 2^(3-2) = 2
-----------------------------------