Сибирский федеральный университет

Тип публикации: статья из журнала

Год издания: 2021

Идентификатор DOI: 10.1134/S0361768821010060

Аннотация: Abstract: This paper proposes an algorithmic implementation of the elementary version of Runge’s method for a family of fourth-degree Diophantine equations in two unknowns. Any Diophantine equation of the fourth degree the leading homogeneous part of which is decomposed into a product of linear and cubic polynomials can be reduced to equations of the type considered in this paper. The corresponding algorithm (in its optimized version) is implemented in the PARI/GP computer algebra system. © 2021, Pleiades Publishing, Ltd.

Журнал: Programming and Computer Software

Выпуск журнала: Vol. 47, Is. 1

Номера страниц: 29-33

ISSN журнала: 03617688

Издатель: Pleiades journals

• Osipov N.N. (Siberian Fed Univ, Sch Space & Informat Technol, Ul Kirenskogo 26, Krasnoyarsk 660074, Russia)
• Kytmanov A.A. (Siberian Fed Univ, Sch Space & Informat Technol, Ul Kirenskogo 26, Krasnoyarsk 660074, Russia)

• Scopus
• Web of Science Core Collection