An Algorithmic Implementation of Runge’s Method for Cubic Diophantine Equations

DOI10.17516/1997-1397-2018-11-2-137-147zbMath1460.11150OpenAlexW2794737021WikidataQ129617197 ScholiaQ129617197MaRDI QIDQ5853221

Bella V. Gulnova, Nikolay N. Osipov

Publication date: 18 March 2021

Published in: Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/jsfu662

zbMATH Keywords

Runge's methodcubic Diophantine equations

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Cubic and quartic Diophantine equations (11D25)

Related Items

Unnamed Item, An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition, An Elementary Algorithm for Solving a Diophantine Equation of Degree Fourth with Runge’s Condition

Cites Work

• Unnamed Item
• A simple method for solving the Diophantine equation \(Y^2=X^4+aX^3+bX^2+cX+d\)
• Classical diophantine equations
• Polynomial bounds for the solutions of a class of diophantine equations
• Determination of Bounds for the Solutions to those Binary Diophantine Equations that Satisfy the Hypotheses of Runge's Theorem
• An Algorithm for Solving a Certain Class of Diophantine Equations. I
• A quantitative version of Runge's theorem on diophantine equations
• Pell's equation