摘要
设D是大于1的奇数,p是与D互素的素数.本文运用Baker方法基本上解决了Diophantus方程x^2±D^m=p^n的可解性问题.
Let D be an odd integer with D>1, and let p be a prime with P×D, in this paper, we basically solve the solvability of the equation x^2±D^m = p^n by the Baker method.
出处
《铁道科学与工程学报》
CAS
CSCD
1991年第2期87-92,共6页
Journal of Railway Science and Engineering
关键词
不定方程
可解性
BAKER方法
Diophantine Equation, Solvability, The Baker Method