Thue's theorem and the diophantine equation $x^2-Dy^2=\pm N$

DOI10.1090/S0025-5718-01-01381-3zbMath1002.11030OpenAlexW1975495852MaRDI QIDQ4529719

Keith R. Matthews

Publication date: 6 May 2002

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-01-01381-3

zbMATH Keywords

explicit representations of integers by quadratic forms

Mathematics Subject Classification ID

Sums of squares and representations by other particular quadratic forms (11E25) Quadratic and bilinear Diophantine equations (11D09) Computer solution of Diophantine equations (11Y50)

Related Items (1)

Unnamed Item

Uses Software

• CALC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cornacchia's algorithm
• A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ
• An Efficient Algorithmic Solution of the Diophantine Equation u 2 + 5υ 2 = m
• Editor's Corner: The Euclidean Algorithm Strikes Again
• Note on Representing a Prime as a Sum of Two Squares

This page was built for publication: Thue's theorem and the diophantine equation $x^2-Dy^2=\pm N$