Authors: Raj C Thiagarajan
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.
Comments: 5 Pages. An engineering proof to Beals Conjecture; This paper shows proof and highlights that finding a counter example is not possible due to the intrinsic nature of the equation which will have gcd greater than 1
Download: PDF
[v1] 2014-03-26 07:30:09
Unique-IP document downloads: 613 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.