Authors: Zhang Tianshu
The ABC conjecture seemingly is difficult to carry conviction in the face of satisfactory many primes and satisfactory many odd numbers of 6K±1 from operational results of computer programs. So we select and adopt a specific equality 1+2N(2N-2)=(2N-1)2 with N≥2 satisfying 2N-1>(Rad(2N-2))1+ ε. Then, proceed from the analysis of the limits of values of ε to find its certain particular values, thereby finally negate the ABC conjecture once and for all.
Comments: 18 Pages.
[v1] 2016-11-30 07:48:39
Unique-IP document downloads: 48 times
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.