Diophantine equation/Related Articles

See also changes related to Diophantine equation, or pages that link to Diophantine equation or to this page or whose text contains "Diophantine equation".

---

Parent topics

• Equation [r]: A mathematical relationship between quantities stated to be equal, seen as a problem involving variables for which the solution is the set of values for which the equality holds. ^[e]
• Number theory [r]: The study of integers and relations between them. ^[e]

Subtopics

• Pell equation [r]: Add brief definition or description
• Pythagorean triplet [r]: Add brief definition or description
• Fermat's last theorem [r]: Theorem that the equation an + bn = cn has no solutions in positive integers a, b, c if n is an integer greater than 2. ^[e]

Other related topics

• Integer [r]: The positive natural numbers (1, 2, 3, …), their negatives (−1, −2, −3, ...) and the number zero. ^[e]
• Diophantus [r]: Add brief definition or description
• Chinese remainder theorem [r]: Theorem that if the integers m1, m2, …, mn are relatively prime in pairs and if b1, b2, …, bn are integers, then there exists an integer that is congruent to bi modulo mi for i=1,2, …, n. ^[e]
• Euclidean algorithm [r]: Algorithm for finding the greatest common divisor of two integers ^[e]
• Hilbert's tenth problem [r]: Add brief definition or description
• Diophantine geometry [r]: Add brief definition or description

Articles related by keyphrases (Bot populated)

• Algebra [r]: A branch of mathematics concerning the study of structure, relation and quantity. ^[e]
• Chinese remainder theorem [r]: Theorem that if the integers m1, m2, …, mn are relatively prime in pairs and if b1, b2, …, bn are integers, then there exists an integer that is congruent to bi modulo mi for i=1,2, …, n. ^[e]
• Fourier operator [r]: In mathematics, a linear integral operator. ^[e]
• Geometric series [r]: A series associated with a geometric sequence, i.e., consecutive terms have a constant ratio. ^[e]