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.
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.
Provides information on this equation, solved by Brahmagupta in 628 AD.
Some of conjectures and open problems, compiled at AIM.
Triangles in the Euclidean plane such that all three sides are rational. With tables of Heronian and Pythagorean triples.
The page establishes that the conjecture is true for all integers. Tables and software by Allan Swett.
Definition of the problem and a list of special cases that have been solved, by Clemens Heuberger.
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us