On the diophantine equation \(x^ 2-D=4p^ n\)
type: Item
instance of: scholarly article
title: On the diophantine equation \(x^ 2-D=4p^ n\)
zbMATH Open document ID: 0765.11017
DOI: 10.1016/0022-314X(92)90124-8
author: Le Maohua
published in: Journal of Number Theory
publication date: 1993-01-17T00:00:00Z
review text: Let \(D\) be an odd positive integer, and \(p\) an odd prime not dividing \(D\). Further let \(N(D,p)\) denote the number of positive solutions \((x,n)\) of the diophantine equation \(x^ 2-D=4p^ n\). This equation has three solutions if \(D\) is of type I, that is, \(D=p^{2m_ 2}+p^{2m_ 1} - 2p^{m_ 2+m_ 1} -2p^{m_ 2} -2p^{m_ 1}+1\), \(m_ 1,m_ 2\in\mathbb{N}\), \(m_ 2>m_ 1\), or \(D\) is of type II, where \(D=(p^{4m}- 14p^{2m}+1)/4\), \(p=3\), \(m\in\mathbb{N}\). By a careful combination of elementary arithmetic lemmata with the known theorems on linear forms in logarithms by Baker, Mignotte, and Waldschmidt, the author is able to prove: (i) If \(D\) is of type I, then \(N(D,p)\leq 5\). (ii) If \(D\) is of type II, then \(N(D,p)\leq 4\). For a suitable \(Z_ 0\in\mathbb{N}\) (related to the least positive solution \(Z\) of \(X^ 2-DY^ 2=4p^ Z)\): (iii) If \(p^{Z_ 0}>D\), then \(N(D,p)\leq 3\), if \(p^{Z_ 0}\geq 200\), otherwise \(N(D,p)\leq 4\). (iv) If \(\max(D,p^{Z_ 0})\geq 10^{60}\), and \(D\) is not of type I or II, then \(N(D,p)\leq 3\).
Mathematics Subject Classification ID: 11D61
zbMATH DE Number: 96561
zbMATH Keywords: exponential diophantine equation
zbMATH Keywords: linear forms in logarithms
reviewed by: Bernd Richter
MaRDI profile type: Publication
cites work: On the generalized Ramanujan-Nagell equation I
cites work: On the generalized Ramanujan-Nagell equation, II
cites work: Two-weight ternary codes and the equation \(y^2=4 \times 3^\alpha+13\)
cites work: On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )
cites work: Q5546885
cites work: Q3941473
cites work: The Diophantine Equation x 2 = 4q n + 4q m + 1
cites work: Q3231253
cites work: Linear forms in two logarithms and Schneider's method (III)
cites work: The diophantine equation \(x^ 2=4q^{a/2}+4q+1\), with an application to coding theory
full work available at URL: 0022-314x(92)90124-8
OpenAlex ID: W4205872564
Recommended article: On the diophantine equation \(x^ 2+D=4p^ n\)
Recommended article: On the Diophantine equation \(x^2 - 4p^m = \pm y^n\)
Recommended article: Q3062407
Recommended article: On the Diophantine equation \(x^{2}+p^{2k+1}=4y^{n}\)
Recommended article: On the diophantine equation \(D_ 1 x^ 2+ D^ m_ 2= 4y^ n\)
Recommended article: Q4368244
Recommended article: Q4385641
Recommended article: On the diophantine equation 𝑥²=4𝑞^{𝑚}-4𝑞ⁿ+1
Recommended article: On the Diophantine equation \(d_1x^2+4d_2=y^n\)
Recommended article: On the Diophantine equation \(x^2-Dy^4=1\)
description: scientific article; zbMATH DE number 96561