On incompatibility of a nonlinear equations over set of natural numbers

S.L. Krivoi, A.V. Nevmerzhitskiy

Abstract


Satisfaction problem of equation x m + y m = z m over set of positive natural numbers, where m and z are prime is consider. General case of this equation, is called “big” Fermata’s theorem, has been decided by using very complexity methods [1, 2]. In this paper is presented local result using by elementary methods.

References


Wiles A. Modular elliptic curves and Fermat’s Last Theorem // Annals of Mathemat. – 1995. – 2, – N 141. – P. 443—551.

Taylor R., Wiles A. Ring-theoretic properties of sertain Hecke algebras // Ibid. – P. 553—572.

Contenjean E., Devie H. Solving systems of linear diophantine equations // Proc. 3rd Workshop on Unification. – Lambrecht: University of Kaiserslautern, 1989. – P. 19—26.

Pottier L. Minimal solutions of linear diophantine systems: bounds and algorithms // Proc. of the Fourth Intern. conf. on Rewriting Techniques and Applications. – Como, – 1991. – P. 162—173.

Domenjoud E. Outils pour la deduction automatique dans les theories associativescommutatives. Thesis de Doctorat d'Universite: Universite de Nancy I. France. – 1991. – 176 p.

Clausen M., Fortenbacher A. Efficient solution of linear diophantine equations // J. Symbolic Computation. – 1989. – 8, – N 1, 2. – P. 201—216.

Romeuf J. F. A polinomial Algorithm for Solving systems of two linear Diophantine equations // TCS. – 1990. – 74, – N 3. – P. 329—340.

Filgueiras M., Tomas A.P. A Fast Method for Finding the Basis of Non-negative Solutions to a Linear Diophantine Equation // J. Symbolic Computation. – 1995. –19, – N 2. – P. 507—526.

Кривой С.Л. О некоторых методах решения и критериях совместности систем линейных диофантовых уравнений в множестве натуральных чисел // Кибернетика и системный анализ. – 1999. – N 4. – P. 12—36.

Живые числа. Пять экскурсий. В. Боро, Ю. Цагир, Ю. Рельфо и др. – М.: Мир. – 1985. – 126 с.


Refbacks

  • There are currently no refbacks.