A Lucas-Lehmer approach to generalised Lebesgue-Ramanujan-Nagell equations
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.