Answers are grounded in this paper and cite their sources.
We completely solve the Diophantine equation x2+2k11ℓ19m=yn in integers x,y≥1; k,ℓ,m≥0 and n≥3 with gcd(x,y)=1, except the case 2|k, 2∤ℓm and 5|n. We use this result to recover some earlier results in the same direction.
No takes yet. Share an insight, caveat, or question.
Chakraborty et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: