Answers are grounded in this paper and cite their sources.
In this paper, we find all solutions of the Diophantine equation x 2 + C = y n in integers x , y ≥ 1, a , b , c ≥ 0, n ≥ 3, with gcd( x , y ) = 1, when C = 2 a 3 b 17 c and C = 2 a 13 b 17 c .
No takes yet. Share an insight, caveat, or question.
Godinho et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: