2013viXraRequires access

A Short Proof of Beal's Conjecture

Frank Vega

Open publisher page 0 citations

Abstract

It was proved if $A^{x} + B^{y} = C^{z}$, where $A$, $B$, $C$, $x$, $y$ and $z$ are positive integers and $x$, $y$ and $z$ are all greater than $2$, then $A$, $B$ and $C$ must have a common prime factor. Therefore, it was demonstrated the Beal's conjecture as a consequence of using a modification to the Binomial theorem.

About this research paper

What this paper is about

It was proved if $A^{x} + B^{y} = C^{z}$, where $A$, $B$, $C$, $x$, $y$ and $z$ are positive integers and $x$, $y$ and $z$ are all greater than $2$, then $A$, $B$ and $C$ must have a common prime factor. Therefore, it was demonstrated the Beal's conjecture as a consequence of using a modification to the Binomial theorem.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

It was proved if $A^{x} + B^{y} = C^{z}$, where $A$, $B$, $C$, $x$, $y$ and $z$ are positive integers and $x$, $y$ and $z$ are all greater than $2$, then $A$, $B$ and $C$ must have a common prime factor. Therefore, it was demonstrated the Beal's conjecture as a consequence of using a modification to the Binomial theorem.

Key concepts: Number theory, Beal's conjecture, Mathematics, Conjecture, Binomial theorem, Prime (order theory), Combinatorics, Discrete mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
A Short Proof of Beal's Conjecture — Research Paper | ScholarLens