Algorithm to solve certain ternary quartic Diophantine equations
From MaRDI portal
Publication:2862250
Recommendations
- An algorithm for solving a quartic Diophantine equation satisfying Runge's condition
- An elementary algorithm for solving a Diophantine equation of degree four with Runge's condition
- An Algorithm for Solving a Certain Class of Diophantine Equations. I
- On the quartic Diophantine equation \(f(x,y) = f(u,v)\)
- An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition
Cited in
(5)- On some ternary quartic Diophantine equations
- An elementary algorithm for solving a Diophantine equation of degree four with Runge's condition
- An algorithm for solving a quartic Diophantine equation satisfying Runge's condition
- Finiteness results for \(F\)-Diophantine sets
- On the Diophantine equation \(y^p = f(x_1, x_2,\ldots, x_r)\)
This page was built for publication: Algorithm to solve certain ternary quartic Diophantine equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2862250)