Diophantine equations. (English) Zbl 0188.34503
MSC:
11Dxx | Diophantine equations |
11-02 | Research exposition (monographs, survey articles) pertaining to number theory |
11-03 | History of number theory |
Online Encyclopedia of Integer Sequences:
Positive cubefree integers n such that the Diophantine equation X^3 + Y^3 = n*Z^3 has solutions.Numbers that are both triangular and tetrahedral.
Complete list of solutions to y^2 = x^3 + 17; sequence gives y values.
Complete list of solutions to y^2 = x^3 + 17; sequence gives x values.
Numbers n such that n^2 + 7 is a power of 2.
Primes congruent to 3 (mod 16).
Complete list of solutions to y^2 = x^3 + 17; sequence gives x values.
Complete list of solutions to y^2 = x^3 + 17; sequence gives y values.
Primes of the form x^2 + 840*y^2.
Primitive solutions x of the Diophantine equation x^2 + y^3 = z^7, gcd(x,y,z) = 1.
The Ramanujan-Nagell squares: A038198(n)^2.
Solutions n to the Diophantine equation: n = (2*x^2 - 1)^2 = (6*y^2 - 5).