Raj C Thiagarajan
Abstract
Open-access reader
In this paper, we provide computational results and a proof for Beal’s conjecture. We demonstrate that the common prime factor is intrinsic to this conjecture using the laws of powers. We show that the greatest common divisor is greater than 1 for the Beal’s conjecture.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we provide computational results and a proof for Beal’s conjecture. We demonstrate that the common prime factor is intrinsic to this conjecture using the laws of powers. We show that the greatest common divisor is greater than 1 for the Beal’s conjecture.
Key concepts: Beal's conjecture, Conjecture, Number theory, Mathematics, Prime factor, Divisor (algebraic geometry), Greatest common divisor, Prime (order theory)