Category:Diophantine equations
 | Computing portal |
Here is a list of articles in the Diophantine equations category of the Computing portal that unifies foundations of mathematics and computations using computers. Template:MSC
Subcategories
This category has the following 2 subcategories, out of 2 total.
Pages in category "Diophantine equations"
The following 63 pages are in this category, out of 63 total.
*
- Diophantine equation (computing)
A
- ABS methods (computing)
- Archimedes's cattle problem (computing)
B
- Beal conjecture (computing)
- Bézout's identity (computing)
- Bhaskara's lemma (computing)
- Birch's theorem (computing)
- Brahmagupta's problem (computing)
- Brauer's theorem on forms (computing)
- Brocard's problem (computing)
- Brown numbers (computing)
C
- Cannonball problem (computing)
- Catalan's conjecture (computing)
- Chakravala method (computing)
- Coin problem (computing)
- Congruum (computing)
- Cuboid conjectures (computing)
D
- Diophantine quintuple (computing)
- Diophantine set (computing)
- Diophantus and Diophantine Equations (computing)
- Diophantus II.VIII (computing)
E
- Effective results in number theory (computing)
- Eisenstein triple (computing)
- Equation xʸ = yˣ (computing)
- Equation xʸ=yˣ (computing)
- Erdős–Diophantine graph (computing)
- Erdős–Straus conjecture (computing)
- Erdős–Moser equation (computing)
- Euler brick (computing)
- Euler's sum of powers conjecture (computing)
F
- Fermat's right triangle theorem (computing)
- Fermat–Catalan conjecture (computing)
G
- Goormaghtigh conjecture (computing)
H
- Hasse principle (computing)
- Heegner's lemma (computing)
- Hilbert's tenth problem (computing)
- Hundred Fowls Problem (computing)
I
- Proof by infinite descent (computing)
J
- Jacobi–Madden equation (computing)
K
- Kaprekar number (computing)
L
- Lander, Parkin, and Selfridge conjecture (computing)
- Legendre's equation (computing)
- Lonely runner conjecture (computing)
M
- Markov number (computing)
- The monkey and the coconuts (computing)
- Mordell curve (computing)
N
- Norm form (computing)
O
- Optic equation (computing)
P
- Pell's equation (computing)
- Perfect digital invariant (computing)
- Prouhet–Tarry–Escott problem (computing)
- Pythagorean quadruple (computing)
- Pythagorean triple (computing)
R
- Ramanujan–Nagell equation (computing)
S
- Siegel identity (computing)
- Siegel's theorem on integral points (computing)
- List of sums of reciprocals (computing)
- Sums of three cubes (computing)
T
- Thue equation (computing)
- Tijdeman's theorem (computing)
- Tree of primitive Pythagorean triples (computing)
- Tunnell's theorem (computing)
V
- Vieta jumping (computing)
Mathematics
Organizations
Books
About