MrAwojobi

Fermat’s Last Theorem The theorem states that Aⁿ + Bⁿ ≠ Cⁿ if n > 2, A, B and C are all positive integers. Andrew Wiles produced a lengthy proof of over 100 pages in the mid 1990s.
If A, B and C have a highest common factor f > 1, fⁿ can be cancelled out to give a new Fermat inequation with new values for A, B and C. In order to prove the theorem it is sufficient therefore to consider only cases where A, B and C have a highest common factor f = 1 i.e. ‘primitive’ inequations.
Beal’s Conjecture: If P^x + Q^y = R^z where P, Q, R, x, y and z are positive integers, x > 2, y > 2 and z > 2 then P, Q and R must have a highest common factor > 1.

Proof of Fermat’s Last Theorem Fermat’s inequation can be rewritten as Cⁿ - Bⁿ ≠ Aⁿ where A, B and C have a highest common factor f = 1. Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)]. Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)/F]. Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2 (C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)/F = I^n C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1) = FI^n C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = F I^n - B^(n-1) - C^(n-1) C B[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3) = FI^n - B^(n-1) - C^(n-1) This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore F I^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) - C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. This means that Cⁿ - Bⁿ ≠ Aⁿ, hence the proof.
Proof of Beal’s Conjecture Let it be initially assumed that P, Q and R have a highest common factor = 1. P^x + Q^y = R^z can be rewritten as {R^(z/n) - Q^(y/n)}([R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2) [Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)} = P^x. When n is odd an alternative equation is [P^(x/n)]^n + [Q^(y/n)]^n = R^z {P^(x/n) + Q^(y/n) [[P^(x/n)]^(n-1) -[P^(x/n)]^(n-2) [Q^(y/n)] + ….. - [P^(x/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)= R^z where n > 2 is a positive integer. For the equation written in these factorized forms to produce integer values for P^x and R^z, it should be clear that P^(x/n) , Q^(y/n) and R^(z/n) must be integers. It is no wonder that all examples of Beal’s equation can be derived from equations of either of these forms in which two exponents are the same. Let P^(x/n) = A, Q^(y/n) = B and R^(z/n) = C where A, B and C have a highest common factor = 1 since P, Q and R have a highest common factor = 1. {R^(z/n) - Q^(y/n)} {[R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2)[Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) +[Q^(y/n)]^(n-1)} = [C - B][C^(n-1) + C^(n-2) B + ….. + CB^(n-2) + B^(n-1). Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)/F] Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2(C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider (Cⁿ-1 + Cn-2B + ….. + CBⁿ-2 + Bⁿ-1)/F = I^n Cⁿ-1 + Cn-2B + ….. + CBⁿ-2 + Bⁿ-1 = FI^n C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = F I^n - B^(n-1) - C^(n-1) C B[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3) = FI^n - B^(n-1) - C^(n-1). This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore F I^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) - C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. This means that Cⁿ - Bⁿ ≠ Aⁿ. The only way for FI^n - B^(n-1) - C^(n-1) to simultaneously be a multiple of B and C is if B, C and therefore A have a highest common factor > 1. This proves the validity of Beal’s conjecture.

Fermat’s Last Theorem: The theorem states that Aⁿ + Bⁿ ≠ Cⁿ if n > 2, A, B and C are all positive integers. Andrew Wiles produced a lengthy proof of over 100 pages in the mid 1990s.
If A, B and C have a highest common factor f > 1, fⁿ can be cancelled out to give a new Fermat inequation with new values for A, B and C. In order to prove the theorem it is sufficient therefore to consider only cases where A, B and C have a highest common factor f = 1 i.e. ‘primitive’ inequations.

Beal’s Conjecture: If P^x + Q^y = R^z where P, Q, R, x, y and z are positive integers, x>2, y>2 and z>2 then P, Q and R must have a highest common factor > 1.

Proof of Fermat’s Last Theorem: Fermat’s inequation can be rewritten as Cⁿ - Bⁿ ≠ Aⁿ where A, B and C have a highest common factor f = 1. Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)]. Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)}/F]. Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2 (C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n. C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1) = FI^n. C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = FI^n - B^(n-1) - C^(n-1) CB[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3)] = FI^n - B^(n-1) - C^(n-1). This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore FI^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) -
C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. This means that Cⁿ - Bⁿ ≠ Aⁿ, hence the proof.

Proof of Beal’s Conjecture: Let it be initially assumed that P, Q and R have a highest common factor = 1. P^x + Q^y = R^z can be rewritten as {R^(z/n) - Q^(y/n)}{[R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2) [Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)} = P^x. When n is odd an alternative equation is [P^(x/n)]^n + [Q^(y/n)]^n = R^z. [P^(x/n) + Q^(y/n)][P^(x/n)]^(n-1) - [P^(x/n)]^(n-2) [Q^(y/n)] + ….. - [P^(x/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)= R^z where n > 2 is a positive integer. For the equation written in these factorized forms to produce integer values for P^x and R^z, it should be clear that P^(x/n) , Q^(y/n) and R^(z/n) must be integers. It is no wonder that all examples of Beal’s equation can be derived from equations of either of these forms in which two exponents are the same. Let P^(x/n) = A, Q^(y/n) = B and R^(z/n) = C where A, B and C have a highest common factor = 1 since P, Q and R have a highest common factor = 1. {R^(z/n) - Q^(y/n)}{[R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2)[Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) +[Q^(y/n)]^(n-1)} = [C - B][C^(n-1) + C^(n-2) B + ….. + CB^(n-2) + B^(n-1)]. Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + CB^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)}/F]. Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2 (C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n. C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1) = FI^n. C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = FI^n - B^(n-1) - C^(n-1) CB[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3)] = FI^n - B^(n-1) - C^(n-1). This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore FI^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) -
C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. The only way for FI^n - B^(n-1) - C^(n-1) to simultaneously be a multiple of B and C is if B, C and therefore A have a highest common factor > 1. This proves the validity of Beal’s conjecture.

Fermat’s Last Theorem: The theorem states that Aⁿ + Bⁿ ≠ Cⁿ if n > 2, A, B and C are all positive integers. Andrew Wiles produced a lengthy proof of over 100 pages in the mid 1990s.
If A, B and C have a highest common factor f > 1, fⁿ can be cancelled out to give a new Fermat inequation with new values for A, B and C. In order to prove the theorem it is sufficient therefore to consider only cases where A, B and C have a highest common factor f = 1 i.e. ‘primitive’ inequations.

Beal’s Conjecture: If P^x + Q^y = R^z where P, Q, R, x, y and z are positive integers, x>2, y>2 and z>2 then P, Q and R must have a highest common factor > 1.

Proof of Fermat’s Last Theorem: Fermat’s inequation can be rewritten as Cⁿ - Bⁿ ≠ Aⁿ where A, B and C have a highest common factor f = 1. Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)]. Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)}/F]. Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2 (C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n. C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1) = FI^n. C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = FI^n - B^(n-1) - C^(n-1) CB[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3)] = FI^n - B^(n-1) - C^(n-1). This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore FI^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) -
C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. This means that Cⁿ - Bⁿ ≠ Aⁿ, hence the proof.

Proof of Beal’s Conjecture: Let it be initially assumed that P, Q and R have a highest common factor = 1. P^x + Q^y = R^z can be rewritten as {R^(z/n) - Q^(y/n)}{[R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2) [Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)} = P^x. When n is odd an alternative equation is [P^(x/n)]^n + [Q^(y/n)]^n = R^z. [P^(x/n) + Q^(y/n)][P^(x/n)]^(n-1) - [P^(x/n)]^(n-2) [Q^(y/n)] + ….. - [P^(x/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)= R^z where n > 2 is a positive integer. For the equation written in these factorized forms to produce integer values for P^x and R^z, it should be clear that P^(x/n) , Q^(y/n) and R^(z/n) must be integers. It is no wonder that all examples of Beal’s equation can be derived from equations of either of these forms in which two exponents are the same. Let P^(x/n) = A, Q^(y/n) = B and R^(z/n) = C where A, B and C have a highest common factor = 1 since P, Q and R have a highest common factor = 1. {R^(z/n) - Q^(y/n)}{[R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2)[Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) +[Q^(y/n)]^(n-1)} = [C - B][C^(n-1) + C^(n-2) B + ….. + CB^(n-2) + B^(n-1)]. Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + CB^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)}/F]. Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2 (C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n. C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1) = FI^n. C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = FI^n - B^(n-1) - C^(n-1) CB[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3)] = FI^n - B^(n-1) - C^(n-1). This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore FI^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) -
C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. The only way for FI^n - B^(n-1) - C^(n-1) to simultaneously be a multiple of B and C is if B, C and therefore A have a highest common factor > 1. This proves the validity of Beal’s conjecture.

Fermat’s Last Theorem: The theorem states that Aⁿ + Bⁿ ≠ Cⁿ if n > 2, A, B and C are all positive integers. Andrew Wiles produced a lengthy proof of over 100 pages in the mid 1990s.
If A, B and C have a highest common factor f > 1, fⁿ can be cancelled out to give a new Fermat inequation with new values for A, B and C. In order to prove the theorem it is sufficient therefore to consider only cases where A, B and C have a highest common factor f = 1 i.e. ‘primitive’ inequations.

Beal’s Conjecture: If P^x + Q^y = R^z where P, Q, R, x, y and z are positive integers, x>2, y>2 and z>2 then P, Q and R must have a highest common factor > 1.

Proof of Fermat’s Last Theorem: Fermat’s inequation can be rewritten as Cⁿ - Bⁿ ≠ Aⁿ where A, B and C have a highest common factor f = 1. Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)]. Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)}/F]. Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2 (C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n. C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1) = FI^n. C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = FI^n - B^(n-1) - C^(n-1) CB[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3)] = FI^n - B^(n-1) - C^(n-1). This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore FI^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) -
C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. This means that Cⁿ - Bⁿ ≠ Aⁿ, hence the proof.

Proof of Beal’s Conjecture: Let it be initially assumed that P, Q and R have a highest common factor = 1. P^x + Q^y = R^z can be rewritten as {R^(z/n) - Q^(y/n)}{[R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2) [Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)} = P^x. When n is odd an alternative equation is [P^(x/n)]^n + [Q^(y/n)]^n = R^z. [P^(x/n) + Q^(y/n)][P^(x/n)]^(n-1) - [P^(x/n)]^(n-2) [Q^(y/n)] + ….. - [P^(x/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)= R^z where n > 2 is a positive integer. For the equation written in these factorized forms to produce integer values for P^x and R^z, it should be clear that P^(x/n) , Q^(y/n) and R^(z/n) must be integers. It is no wonder that all examples of Beal’s equation can be derived from equations of either of these forms in which two exponents are the same. Let P^(x/n) = A, Q^(y/n) = B and R^(z/n) = C where A, B and C have a highest common factor = 1 since P, Q and R have a highest common factor = 1. {R^(z/n) - Q^(y/n)}{[R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2)[Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) +[Q^(y/n)]^(n-1)} = [C - B][C^(n-1) + C^(n-2) B + ….. + CB^(n-2) + B^(n-1)]. Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + CB^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)}/F]. Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2 (C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n. C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1) = FI^n. C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = FI^n - B^(n-1) - C^(n-1) CB[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3)] = FI^n - B^(n-1) - C^(n-1). This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore FI^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) -
C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. The only way for FI^n - B^(n-1) - C^(n-1) to simultaneously be a multiple of B and C is if B, C and therefore A have a highest common factor > 1. This proves the validity of Beal’s conjecture.

Fermat’s Last Theorem: The theorem states that Aⁿ + Bⁿ ≠ Cⁿ if n > 2, A, B and C are all positive integers. Andrew Wiles produced a lengthy proof of over 100 pages in the mid 1990s.
If A, B and C have a highest common factor f > 1, fⁿ can be cancelled out to give a new Fermat inequation with new values for A, B and C. In order to prove the theorem it is sufficient therefore to consider only cases where A, B and C have a highest common factor f = 1 i.e. ‘primitive’ inequations.

Beal’s Conjecture: If P^x + Q^y = R^z where P, Q, R, x, y and z are positive integers, x>2, y>2 and z>2 then P, Q and R must have a highest common factor > 1.

Proof of Fermat’s Last Theorem: Fermat’s inequation can be rewritten as Cⁿ - Bⁿ ≠ Aⁿ where A, B and C have a highest common factor f = 1. Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)]. Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)}/F]. Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2 (C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n. C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1) = FI^n. C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = FI^n - B^(n-1) - C^(n-1) CB[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3)] = FI^n - B^(n-1) - C^(n-1). This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore FI^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) -
C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. This means that Cⁿ - Bⁿ ≠ Aⁿ, hence the proof.

Proof of Beal’s Conjecture: Let it be initially assumed that P, Q and R have a highest common factor = 1. P^x + Q^y = R^z can be rewritten as {R^(z/n) - Q^(y/n)}{[R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2) [Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)} = P^x. When n is odd an alternative equation is [P^(x/n)]^n + [Q^(y/n)]^n = R^z. [P^(x/n) + Q^(y/n)][P^(x/n)]^(n-1) - [P^(x/n)]^(n-2) [Q^(y/n)] + ….. - [P^(x/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)= R^z where n > 2 is a positive integer. For the equation written in these factorized forms to produce integer values for P^x and R^z, it should be clear that P^(x/n) , Q^(y/n) and R^(z/n) must be integers. It is no wonder that all examples of Beal’s equation can be derived from equations of either of these forms in which two exponents are the same. Let P^(x/n) = A, Q^(y/n) = B and R^(z/n) = C where A, B and C have a highest common factor = 1 since P, Q and R have a highest common factor = 1. {R^(z/n) - Q^(y/n)}{[R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2)[Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) +[Q^(y/n)]^(n-1)} = [C - B][C^(n-1) + C^(n-2) B + ….. + CB^(n-2) + B^(n-1)]. Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + CB^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)}/F]. Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2 (C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n. C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1) = FI^n. C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = FI^n - B^(n-1) - C^(n-1) CB[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3)] = FI^n - B^(n-1) - C^(n-1). This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore FI^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) -
C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. The only way for FI^n - B^(n-1) - C^(n-1) to simultaneously be a multiple of B and C is if B, C and therefore A have a highest common factor > 1. This proves the validity of Beal’s conjecture.

MrAwojobi

Fermat’s Last Theorem: The theorem states that Aⁿ + Bⁿ ≠ Cⁿ if n > 2, A, B and C are all positive integers. Andrew Wiles produced a lengthy proof of over 100 pages in the mid 1990s.
If A, B and C have a highest common factor f > 1, fⁿ can be cancelled out to give a new Fermat inequation with new values for A, B and C. In order to prove the theorem it is sufficient therefore to consider only cases where A, B and C have a highest common factor f = 1 i.e. ‘primitive’ inequations.

Beal’s Conjecture: If P^x + Q^y = R^z where P, Q, R, x, y and z are positive integers, x>2, y>2 and z>2 then P, Q and R must have a highest common factor > 1.

Proof of Fermat’s Last Theorem: Fermat’s inequation can be rewritten as Cⁿ - Bⁿ ≠ Aⁿ where A, B and C have a highest common factor f = 1. Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)]. Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)}/F]. Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2 (C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n. C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1) = FI^n. C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = FI^n - B^(n-1) - C^(n-1) CB[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3)] = FI^n - B^(n-1) - C^(n-1). This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore FI^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) -
C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. This means that Cⁿ - Bⁿ ≠ Aⁿ, hence the proof.

Proof of Beal’s Conjecture: Let it be initially assumed that P, Q and R have a highest common factor = 1. P^x + Q^y = R^z can be rewritten as {R^(z/n) - Q^(y/n)}{[R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2) [Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)} = P^x. When n is odd an alternative equation is [P^(x/n)]^n + [Q^(y/n)]^n = R^z. [P^(x/n) + Q^(y/n)][P^(x/n)]^(n-1) - [P^(x/n)]^(n-2) [Q^(y/n)] + ….. - [P^(x/n)] [Q^(y/n)]^(n-2) + [Q^(y/n)]^(n-1)= R^z where n > 2 is a positive integer. For the equation written in these factorized forms to produce integer values for P^x and R^z, it should be clear that P^(x/n) , Q^(y/n) and R^(z/n) must be integers. It is no wonder that all examples of Beal’s equation can be derived from equations of either of these forms in which two exponents are the same. Let P^(x/n) = A, Q^(y/n) = B and R^(z/n) = C where A, B and C have a highest common factor = 1 since P, Q and R have a highest common factor = 1. {R^(z/n) - Q^(y/n)}{[R^(z/n)]^(n-1)+ [R^(z/n)]^(n-2)[Q^(y/n)] + ….. + [R^(z/n)] [Q^(y/n)]^(n-2) +[Q^(y/n)]^(n-1)} = [C - B][C^(n-1) + C^(n-2) B + ….. + CB^(n-2) + B^(n-1)]. Let F be the highest common factor of C-B and C^(n-1) + C^(n-2) B + ….. + CB^(n-2) + B^(n-1). Therefore Cⁿ - Bⁿ = [C - B][C^(n-1) + C^(n-2)B + ….. + C B^(n-2) + B^(n-1)] = F(C - B)/F[F{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = F^2 (C - B)/F[{C^(n-1) + C^(n-2)B + ….. + CB^(n-2) + B^(n-1)}/F]. Since F^2, (C - B)/F and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F have a highest common factor = 1 and if Fermat’s Last Theorem is false then F^2 (C - B)/F[{C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)}/F] = Aⁿ means that F^2 = G^n, (C - B)/F = H^n and [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n where G, H and I are positive integers. Consider [C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1)]/F = I^n. C^(n-1) + C^(n-2) B + ….. + C B^(n-2) + B^(n-1) = FI^n. C^(n-2) B + C^(n-3) B^2 + ….. C^2 B^(n-3) + C B^(n-2) = FI^n - B^(n-1) - C^(n-1) CB[C^(n-3) + C^(n-4) B + ….. C B ^(n-4) + B^(n-3)] = FI^n - B^(n-1) - C^(n-1). This implies that FI^n - B^(n-1) - C^(n-1) must be a multiple of C and B simultaneously. This is a contradiction because FI^n - B^(n-1) - C^(n-1) cannot simultaneously be a multiple of B and C. This is because if FI^n - B^(n-1) is a multiple of C it cannot be a multiple of A or B and therefore FI^n - B^(n-1) - C^(n-1) which will be a multiple of C if FI^n - B^(n-1) is a multiple of C cannot also be a multiple of A or B since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. Similarly if FI^n - C^(n-1) is a multiple of B it cannot be a multiple of A or C and therefore F I^n - B^(n-1) -
C^(n-1) which will be a multiple of B if FI^n - C^(n-1) is a multiple of B cannot also be a multiple of A or C since FI^n, B and C have a highest common factor f = 1 and FI^n is a factor of Aⁿ. The only way for FI^n - B^(n-1) - C^(n-1) to simultaneously be a multiple of B and C is if B, C and therefore A have a highest common factor > 1. This proves the validity of Beal’s conjecture.