Professional Documents
Culture Documents
New Conjectures Related To Sum of Powers
New Conjectures Related To Sum of Powers
INTRODUCTION
The next conjectures I propose are based on computational work about equations
with sum of powers.
The logic or the motive for the following conjectures I suggest is related to the
Fermat Last Theorem.
In the end, such conjectures result in an extended version of the abc conjecture.
(1)
It has been proven that with n > 2 (n being an integer) and A, B and C positive
integers, there is no solution. And that should be the end of the theorem, but far away
from it.
Corollary:
Squaring equation (1) we obtain:
2 + 2 + 2() = 2
That has no positive integer solution with n > 2.
With n > 4 and = 2()0,5 there are no positive integer solutions, but what about
other instances??
CONJECTURES CITATION
Conjecture 1:
= ( 2)
=1
These equations have no solution within the natural numbers domain, with k >
2(n-1).
At the limit of the conjecture exists:
958004 + 2175194 + 4145604 = 4224814
(given by Roger Frye, disproving the Euler Conjecture about the sum of powers)
Conjecture 2:
= +1
=1
The equations that are solutions of this equality, with all k > 2(n-1), imply that
all and have a common prime factor.
Conjecture 3:
= +1 ( 2)
=1
There are a finite number of solutions to each n where the bases are coprime and
1
the exponents confirm the equation +1
=1 1. (Fermat-Catalan conjecture extension)
Conjecture 4:
= ( 2)
=1
ANNEX
I have used parallel computation with 360 CPUs to solve the algorithms of
these equations but, due to the lack of resources, the focus of the search was on the case
of n = 3, bases from 1 to 1000 and exponents from 5 to 15. All the equations found
confirm the conjectures:
Similar algorithms had been applied to the other values of n and no counterexample was found within 2 years of computational work.
REFERENCES
[1] http://www.bealconjecture.com
[2] http://mathworld.wolfram.com/DiophantineEquation4thPowers.html