A. Tyszka, K. Molenda, M. Sporysz, An algorithm which transforms any Diophantine equation into an equivalent system of equations of the forms x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x

Site Search:

INTERNATIONAL MATHEMATICAL FORUM

ISSN 1312-7594 (print) ISSN 1314-7536 (online)

A. Tyszka, K. Molenda, M. Sporysz
An algorithm which transforms any Diophantine equation into an equivalent system of equations of the forms x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k
Int. Math. Forum, Vol. 8, 2013, no. 1-4, 31-37
http://dx.doi.org/10.12988/imf.2013.13004
Copyright © 2013 A. Tyszka, K. Molenda and M. Sporysz. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cited by (2):
Apoloniusz Tyszka, Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation, Information Processing Letters, 113 (2013), no. 19-21, 719-722 [CrossRef]
Apoloniusz Tyszka, A function which does not have any finite-fold Diophantine representation and probably equals, Matematyka Dyskretna, (2013), 1-8 [View at Publisher]

Journals | Books | Author guidelines