Abstract

We describe a computationally efficient approach to resolving equations of the form C_1x^2 + C_2 = y^n in coprime integers, for fixed values of C_1, C_2 subject to further conditions. We make use of a factorisation argument and the Primitive Divisor Theorem due to Bilu, Hanrot and Voutier.

Full Text
Published version (Free)

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 call