Top /
Science /
Math /
Number_Theory /
Diophantine_Equations /
|
Hilbert's Tenth Problem
Given a Diophantine equation with any number of unknowns and with rational integer coefficients: devise a process, which could determine by a finite number of operations whether the equation is solvable in rational integers.
http://www.ltn.lv/~podnieks/gt4.html
Ltn.lv ~
Site Info
Whois
Trace Route
RBL Check
|
|
Quadratic Diophantine Equation Solver
Dario Alpern's Java/JavaScript code that solves Diophantine equations of the form Ax^2 + Bxy + Cy^2 + Dx + Ey + F = 0 in two selectable modes: "solution only" and "step by step" (or "teach") mode. There is also a link to his
http://www.alpertron.com.ar/QUAD.HTM
Alpertron.com.ar ~
Site Info
Whois
Trace Route
RBL Check
|
|
|
|