Abstract
Let k be a positive integer. In this paper, using the modular approach, we prove that if k≡0(mod4), 30<k<724 and 2k−1 is an odd prime power, then under the GRH, the equation x2+(2k−1)y=kz has only one positive integer solution (x,y,z)=(k−1,1,2). The above results solve some difficult cases of Terai’s conjecture concerning this equation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
