An elementary algorithm for solving a Diophantine equation of degree four with Runge's condition
From MaRDI portal
(Redirected from Publication:5853396)
Recommendations
- An algorithm for solving a quartic Diophantine equation satisfying Runge's condition
- An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition
- scientific article; zbMATH DE number 4154522
- Publication:3478455
- Algorithm to solve certain ternary quartic Diophantine equations
Cites work
- A quantitative version of Runge's theorem on diophantine equations
- A simple method for solving the Diophantine equation \(Y^2=X^4+aX^3+bX^2+cX+d\)
- An algorithmic implementation of Runge's method for cubic Diophantine equations
- Classical diophantine equations
- ESTIMATES FOR THE SOLUTIONS OF CERTAIN DIOPHANTINE EQUATIONS BY RUNGE'S METHOD
- scientific article; zbMATH DE number 3300651 (Why is no real title available?)
- On the Diophantine equation F(x)=G(y)
- Sur le théorème de Runge
Cited in
(8)- A fast algorithm for finding ``small solutions of \(F(x,y)= G(x,y)\) over imaginary quadratic fields
- An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition
- An algorithm for solving a quartic Diophantine equation satisfying Runge's condition
- Algorithm to solve certain ternary quartic Diophantine equations
- Resolution of a nontrivial diophantine equation without reduction methods
- 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
- An algorithmic implementation of Runge's method for cubic Diophantine equations
This page was built for publication: An elementary algorithm for solving a Diophantine equation of degree four with Runge's condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5853396)
