ABSTRACT
In this paper we prove in a new way, the well known result, that Fermat’s equation a4 + b4 = c4, is not solvable in , when . To show this result, it suffices to prove that: , is not solvable in , (where , pairwise primes, with necessarly ). The key idea of our proof is to show that if (F0) holds, then there exist , such that , holds too. From where, one conclude that it is not possible, because if we choose the quantity 2 ≤ s, as minimal in value among all the solutions of , then is also a solution of Fermat’s type, but with , witch is absurd. To reach such a result, we suppose first that (F0) is solvable in , s ≥ 2 like above; afterwards, proceeding with “Pythagorician divisors”, we creat the notions of “Fermat’s b-absolute divisors”: which it uses hereafter. Then to conclude our proof, we establish the following main theorem: there is an equivalence between (i) and (ii): (i) (F0): , is solvable in , with , , coprime in pairs. (ii) , coprime in pairs, for wich: coprime in pairs, and , checking , and such that for notations: , with defined by , and , where , the following system is checked: ; and this system implies: ; where: ; From where, it is quite easy to conclude, following the method explained above, and which thus closes, part I, of this article.