The diophantine equation x^{2} + D^{m} = p^{n}

From MaRDI portal
Publication:3765849





Let D be a positive integer, and let p be an odd prime with p \(\nmid D\). For fixed D, p, the author proves that if \(\max (D,p)>C=\exp \exp \exp 1,000\), then the equation \((*)\quad x^ 2+D^ m=p^ n,\) x,m,n\(\in {\mathbb{N}}\), has at most three solutions (x,m,n). In particular, if \(\max (D,p)>C\) and \(p\equiv 3\) (mod 4), then (*) has at most one solution (x,m,n). The proof of the above results depends on the author's work on the generalized Ramanujan-Nagell equation as follows: (*) has at most two solutions with \(m=1\), in particular, if \(\max (D,p)>C\), then (*) has at most one solution with \(m=1\) except when \(p=4s^ 2+1\), \(D=3s^ 2+1\), s is an integer [see the Letters section in Kexue Tongbao, Foreign Lang. Ed. 29, No.2, 278 (1984), ibid. 30, No.6, 850 (1985)].




Cited in
(33)








This page was built for publication: The diophantine equation $x^{2} + D^{m} = p^{n}$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765849)