An Algorithm which Transforms any Diophantine Equation into an Equivalent System ofEquations of the Forms x_i=1, x_i+x_j=x_k, x_i cdot x_j=x_k
Apoloniusz Tyszka , Krzysztof Molenda , Maciej Sporysz
AbstractWe describe an algorithm which transforms any Diophantine equation into an equivalent system of equations of the forms xi = 1, xi + xj = xk, xi · xj = xk. We apply the algorithm to the polynomial x1 · x2 − 1. This procedure is implemented in MuPAD, Sage, and Mathematica.
|Journal series||International Mathematical Forum , ISSN 1312-7594 , (0 pkt)|
|Publication size in sheets||0.5|
|Keywords in English||Diophantine equation, reduction of degree, system of Diophantine equations|
|Score|| = 0.0, 26-07-2017, ArticleFromJournal|
= 5.0, 26-07-2017, ArticleFromJournal
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.