Abstract
We shall show that, for any positive integer D > 0 and any primes p(1), p(2), the diophantine equation x(2) + D = 2(s)p(1)(k)p(2)(l) has at most 63......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
