Font Size: a A A

On The Diophantine Equations X3±P3k=DY2

Posted on:2013-02-14Degree:MasterType:Thesis
Country:ChinaCandidate:M Y HuoFull Text:PDF
GTID:2210330374961573Subject:Basic mathematics
Abstract/Summary:PDF Full Text Request
In this paper the author illustrates from four chapters:The first chapter reviews research status of the Diophantine equationX3±P3k=DY2(D>0).The second chapter gives the preparation knowledge of the paper, and introducesthe nature of the Pell equation, recursive sequence and simple congruence method.The third chapter is mainly divided into four parts for solution of DiophantineequationX3±P3k=DY2while p, D is given different integer.On theDiophantine equationnX3±233k=DY2(Where D>0, d|D, d is not a square and d isnot prime of the form6k+1),the author has got an recursive formula about k in thefirst section. By using the method of recurrent sequence and guadratic remaider theDiophantine equationsx323313y2have only integer solutions (x, y)(23,0)inthe second section.The Diophantine equationsX3±8=73Y2is proven to have nointeger solution with (x, y)=1in the third section,so D=67has not been improvedwith D <80. By using the method of recurrent sequence and proven conclusion,theequationX3±27=43Y2has only integer solutions (x, y)(3,0),(240,567)in thefourth section.The fourth chapter has made the summary and put forward to possible futuredevelopment about the issue.
Keywords/Search Tags:Diophantine Equation, Integer solution, Recursive sequences, Quadraticresidue symbol, Modul
PDF Full Text Request
Related items