  |
Hilbert's Tenth Problem - http://www.ltn.lv/~podnieks/gt4.html
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. |
  |
The Erdos-Strauss Conjecture - http://math.uindy.edu/swett/esc.htm
The page establishes that the conjecture is true for all integers. Tables and software by Allan Swett. |
  |
Quadratic Diophantine Equation Solver - http://www.alpertron.com.ar/QUAD.HTM
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 description of the solving methods. |
  |
Rational and Integral Points on Higher-dimensional Varieties - http://aimath.org/WWN/qptsurface2/
Some of conjectures and open problems, compiled at AIM. |
  |
Pell's Equation - http://www.ieeta.pt/~tos/pell.html
Record solutions. |