Le's conjecture for x2D=4pnx^2-D=4p^n

From papers

Let DD be an odd positive integer, let pp be an odd prime, and let N(D,4,p)N(-D,4,p) denote the number of solutions (x,n)N2(x,n)\in\mathbb{N}^2 of x2D=4pnx^2-D=4p^n. Let cases (i)(i) and (ii)(ii) be the two exceptional cases for (D,p)(D,p) specified in the source. Le's conjecture. If D4pr+1D\neq 4p^r+1, then

N(D,4,p)=3N(-D,4,p)=3

when (D,p)(D,p) is in case (i)(i) or (ii)(ii); otherwise,

N(D,4,p)2.N(-D,4,p)\leq 2.

The survey gives partial bounds but no general proof.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Maohua Le and Gökhan Soydan, “A brief survey on the generalized Lebesgue-Ramanujan-Nagell equation”, arXiv:2001.09617 (2020).

Solutions 0

No solutions have been posted yet.