In this category are included any equation or set of equations where the unknowns must be integer numbers. It includes Fermat Last Theorem as a special case.
More information
More information
Subcategories 2
Sites 13
Searchable, 400 items.
Articles, computations and software in Magma and GP by Martin Bright.
Sets with the property that the product of any two distinct elements is one less than a square. Notes and bibliography by Andrej Dujella.
Lots of information about Egyptian fractions collected by David Eppstein.
Statement of the problem in several languages, history of the problem, bibliography and links to related WWW sites.
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.
A web tool for solving Diophantine equations of the form ax + by = c.
Record solutions.
A JavaScript applet which reads a and gives integer solutions of a^2+b^2 = c^2.
A Javascript calculator for pythagorean triplets.
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.
Some of conjectures and open problems, compiled at AIM.
Definition of the problem and a list of special cases that have been solved, by Clemens Heuberger.
Sets with the property that the product of any two distinct elements is one less than a square. Notes and bibliography by Andrej Dujella.
Record solutions.
A Javascript calculator for pythagorean triplets.
Searchable, 400 items.
A JavaScript applet which reads a and gives integer solutions of a^2+b^2 = c^2.
Lots of information about Egyptian fractions collected by David Eppstein.
Statement of the problem in several languages, history of the problem, bibliography and links to related WWW sites.
Articles, computations and software in Magma and GP by Martin Bright.
A web tool for solving Diophantine equations of the form ax + by = c.
Definition of the problem and a list of special cases that have been solved, by Clemens Heuberger.
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.
Some of conjectures and open problems, compiled at AIM.
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.
Other languages 1
