Diophantine equation;
Integer solution;
S-integers;
Lucas sequence;
Primitive divisors;
X(2)+2(A);
D O I:
10.1007/s13226-022-00347-1
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
In this paper, we solve the Diophantine equation x(2) + C = y(n) in positive integers x, y >= 1; k, l, m >= 0 and n >= 3 with gcd (x, y) = 1, when C = 2(k)73(l)41(m) and C = 2(k)73(l)89(m).