Available in electronic format
Available in print format
Mathematics of Computation
Journal of the American Mathematical Society
ISSN 1088-6842(e) ISSN 0025-5718(p)
     

The Diophantine equation $x^4+1=Dy^2$

Author(s): J. H. E. Cohn.
Journal: Math. Comp. 66 (1997), 1347-1351.
MSC (1991): Primary 11D25
Retrieve article in: PDF DVI PostScript
This article is available free of charge

Abstract | References | Similar articles | Additional information

Abstract: An effective method is derived for solving the equation of the title in positive integers $x$ and $y$ for given $D$ completely, and is carried out for all $D<100000$. If $D$ is of the form $m^4+1$, then there is the solution $x=m$, $y=1$; in the above range, except for $D=70258$ with solution $x=261$, $y=257$, there are no other solutions.


References:

1.
J. H. E. Cohn, Lucas and Fibonacci numbers and some Diophantine equations, Proc. Glasgow Math. Assoc. 7 (1965), 24-28. MR 31:2202

2.
Wilhelm Ljunggren, Einige Sätze über unbestimmte Gleichungen von der Form $Ax^4+Bx^2+C=Dy^2$, Vid-Akad. Skr. Norske Oslo 1942 No. 9.


Similar Articles:

Retrieve articles in Mathematics of Computation with MSC (1991): 11D25

Retrieve articles in all Journals with MSC (1991): 11D25


Additional Information:

J. H. E. Cohn
Affiliation: Department of Mathematics, Royal Holloway University of London, Egham, Surrey TW20 0EX, United Kingdom
Email: j.cohn@rhbnc.ac.uk

DOI: 10.1090/S0025-5718-97-00851-X
PII: S 0025-5718(97)00851-X
Received by editor(s): March 4, 1996
Copyright of article: Copyright 1997, American Mathematical Society


  AMS Website Logo Small Comments: webmaster@ams.org
© Copyright 2008, American Mathematical Society
Privacy Statement
Search the AMSPowered by Google