Abstract
We completely solve the Diophantine equation x(2) + 2(k)11(l)19(m) = y(n) in integers x, y >= 1; k; l, m >= 0 and n >= 3 with gcd(x, y) = 1, ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
