Proof of the Beal Conjecture through the Fundamental Theorem of Arithmetic

Eric S Watson

doi:10.18052/www.scipress.com/bmsa.12.35

Abstract

This paper gives a proof of the Beal conjecture through the Fundamental Theorem of Arithmetic.

Highlights

Proof: According to the Fundamental Theorem of Arithmetic, every integer greater than 1 is either a prime itself or is the product of prime numbers
This paper gives a proof of the Beal conjecture through the Fundamental Theorem of Arithmetic
Since A, and C are raised to exponential powers greater than 2 that means that A,B, and C are going to be the products of prime numbers themselves or the products of other numbers that can be broken down as the product of primes

Summary

Introduction

Proof: According to the Fundamental Theorem of Arithmetic, every integer greater than 1 is either a prime itself or is the product of prime numbers. Proof of the Beal Conjecture through the Fundamental Theorem of Arithmetic Abstract: This paper gives a proof of the Beal conjecture through the Fundamental Theorem of Arithmetic. Theorem: IfAx+By = Cz, whereA,,C, x,y and z are positive integers andx,y,z>2, A,B and C must have a common prime factor.

Results

Conclusion