ABSTRACT． Led。 be the n^(th) Lucas number， n＞0． Let p be an odd prime． In this paperwe prove a general theorem． According to the theorem we give an algorithm by using whichthe equationl-(n)＝px^(2) can be ...ABSTRACT． Led。 be the n^(th) Lucas number， n＞0． Let p be an odd prime． In this paperwe prove a general theorem． According to the theorem we give an algorithm by using whichthe equationl-(n)＝px^(2) can be solved for arbitrary given p．Por example，we find its all solutionsfor 1000＜p＜40000． By the end of the paper an Interestingconjecture Is presented．展开更多
文摘ABSTRACT． Led。 be the n^(th) Lucas number， n＞0． Let p be an odd prime． In this paperwe prove a general theorem． According to the theorem we give an algorithm by using whichthe equationl-(n)＝px^(2) can be solved for arbitrary given p．Por example，we find its all solutionsfor 1000＜p＜40000． By the end of the paper an Interestingconjecture Is presented．
