On the diophantine equation 𝑥²=4𝑞^{𝑚}-4𝑞ⁿ+1

On the diophantine equation $x^{2}=4q^{m}-4q^{n}+1$
HTML articles powered by AMS MathViewer

by Florian Luca PDF

Proc. Amer. Math. Soc. 131 (2003), 1339-1345 Request permission

In this note, we find all positive integer solutions $(x,q,m,n)$ of the diophantine equation from the title with $q$ a prime power.

References

Yu. Bilu, G. Hanrot, and P. M. Voutier, Existence of primitive divisors of Lucas and Lehmer numbers, J. Reine Angew. Math. 539 (2001), 75–122. With an appendix by M. Mignotte. MR 1863855, DOI 10.1515/crll.2001.080
Mao Hua Le, The Diophantine equation $x^2=4q^n+4q^m+1$, Proc. Amer. Math. Soc. 106 (1989), no. 3, 599–604. MR 968624, DOI 10.1090/S0002-9939-1989-0968624-6
M. Mignotte and A. Pethő, On the Diophantine equation $x^p-x=y^q-y$, Publ. Mat. 43 (1999), no. 1, 207–216. MR 1697521, DOI 10.5565/PUBLMAT_{4}3199_{0}8
Chris Skinner, The Diophantine equation $x^2=4q^n-4q+1$, Pacific J. Math. 139 (1989), no. 2, 303–309. MR 1011215
Nikos Tzanakis and John Wolfskill, The Diophantine equation $x^2=4q^{a/2}+4q+1$, with an application to coding theory, J. Number Theory 26 (1987), no. 1, 96–116. MR 883537, DOI 10.1016/0022-314X(87)90099-0