Hi,
More than year ago I published Article On Beal's Conjecture, the Case (x,y,z)=(n,2n-1,n)
where I proved that Beal's conjecture for the case (x,y,z)=(n,2n-1,n) is true.Today I created a simple Matlab code to test the equations and the algorithm mentioned in the article above, here is the link to Matlab code Deleted research item The research item mentioned here has been deleted
let me know your thoughts
Thanks
Have a look at [ https://www.youtube.com/watch?v=JIOxz3uGMok ] more such related problems: http://www.physics.wm.edu/~finn/home/MathPhysics.pdf
visit this
https://www.mathworks.com/matlabcentral/fileexchange/104310-on-beal-s-conjecture-the-case-x-y-z-n-2n-1-n/?s_tid=LandingPageTabfx
Beal's Hypothesis says If we have A^x+B^y=C^z with GCD(A, B, C) = 1.It has a solution if at least one exponent equals 2. If it has a solution if (x,y,z)=(n,2n-1,n)=(3,5,3) WITH n=3 we will find solutions A=91,B=13,C=104 with GCD(A, B, C) = 13 so it has a common factor so it has a solution. The hypothesis pay attention to what it says i mentioned above . So you are wrong in the hypothesis because A,B,C have common factor . With n>3 it has no solutions from what i looked for A,B,C.
Look...Research Proposal Proof of Beal’s conjecture