On the Diophantine equation x2 + C = yn

被引:0
|
作者
Rayaguru, Sai Gopal [1 ]
机构
[1] Siksha O Anusandhan Univ, Ctr Data Sci, Bhubaneswar 751030, Odisha, India
来源
关键词
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).
引用
收藏
页码:69 / 77
页数:9
相关论文
共 50 条