Abstract
We describe a computationally efficient approach to resolving equations of the form C1x2+C2=yn in coprime integers, for fixed values of C1, C2 subject to further conditions. We make use of a factorisation argument and the Primitive Divisor Theorem due to Bilu, Hanrot and Voutier.
Original language | English |
---|---|
Journal | The Ramanujan Journal |
DOIs | |
Publication status | Published - 2021 |