Thue’s theorem and the diophantine equation 𝑥²-𝐷𝑦²=±𝑁

Matthews, Keith

doi:10.1090/S0025-5718-01-01381-3

Thue’s theorem and the diophantine equation $x^2-Dy^2=\pm N$
HTML articles powered by AMS MathViewer

by Keith Matthews PDF

Math. Comp. 71 (2002), 1281-1286 Request permission

Abstract:

A constructive version of a theorem of Thue is used to provide representations of certain integers as $x^2-Dy^2$, where $D=2,3,5,6,7$.

References

John Brillhart, Note on representing a prime as a sum of two squares, Math. Comp. 26 (1972), 1011–1013. MR 314745, DOI 10.1090/S0025-5718-1972-0314745-6
G. Cornacchia, Su di un metodo per la risoluzione in numeri interi dell’ equazione $\sum _{h=0}^nC_hx^{n-h}=P$, Giornale di Matematiche di Battaglini 46 (1908) 33–90.
Kenneth Hardy, Joseph B. Muskat, and Kenneth S. Williams, A deterministic algorithm for solving $n=fu^2+gv^2$ in coprime integers $u$ and $v$, Math. Comp. 55 (1990), no. 191, 327–343. MR 1023762, DOI 10.1090/S0025-5718-1990-1023762-3
Kenneth Hardy, Joseph B. Muskat, and Kenneth S. Williams, Solving $n=au^2+buv+cv^2$ using the Euclidean algorithm, Utilitas Math. 38 (1990), 225–236. MR 1093893
C. Hermite, Note au sujet de l’article précedent, J. Math. Pures Appl., 13 (1848) 15.
Joseph B. Muskat, A refinement of the Hardy-Muskat-Williams algorithm for solving $n=fu^2+gv^2$, Utilitas Math. 41 (1992), 109–117. MR 1162517
Trygve Nagell, Introduction to number theory, 2nd ed., Chelsea Publishing Co., New York, 1964. MR 0174513
Abderrahmane Nitaj, L’algorithme de Cornacchia, Exposition. Math. 13 (1995), no. 4, 358–365 (French, with English summary). MR 1358213
J.A. Serret, Sur un théorème rélatif aux nombres entières, J. Math. Pures Appl. 13 (1848) 12–14.
Axel Thue, Selected mathematical papers, Universitetsforlaget, Oslo, 1977. With an introduction by Carl Ludwig Siegel and a biography by Viggo Brun; Edited by Trygve Nagell, Atle Selberg, Sigmund Selberg, and Knut Thalberg. MR 0460050
T. Venkatarayudu, The $7$-$15$ problem, Proc. Indian Acad. Sci., Sect. A. 9 (1939), 531. MR 0000001, DOI 10.1090/gsm/058
Stan Wagon, Editor’s corner: the Euclidean algorithm strikes again, Amer. Math. Monthly 97 (1990), no. 2, 125–129. MR 1041889, DOI 10.2307/2323912
Peter Wilker, An efficient algorithmic solution of the Diophantine equation $u^{2}+5v^{2}=m$, Math. Comp. 35 (1980), no. 152, 1347–1352. MR 583512, DOI 10.1090/S0025-5718-1980-0583512-5
Kenneth S. Williams, On finding the solutions of $n=au^2+buv+cv^2$ in integers $u$ and $v$, Utilitas Math. 46 (1994), 3–19. MR 1301291
Kenneth S. Williams, Some refinements of an algorithm of Brillhart, Number theory (Halifax, NS, 1994) CMS Conf. Proc., vol. 15, Amer. Math. Soc., Providence, RI, 1995, pp. 409–416. MR 1353948