Primitive Divisors of Certain Elliptic Divisibility Sequences
Minoru Yabuta
Abstract
Minoru Yabuta
Abstract
Let E : y 2 = x 3 + D be an elliptic curve, where D is an integer that contains no primes p with 6 | ord p D. For a nontorsion rational point P on E, write x(nP) = A n (P)/B 2 n (P) in lowest terms. We prove that for the sequence , the term has a primitive divisor for all m ≥ 3. As an application, we give a new method for solving the Diophantine equation y 2 = x 3 + d n under certain conditions.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let E : y 2 = x 3 + D be an elliptic curve, where D is an integer that contains no primes p with 6 | ord p D. For a nontorsion rational point P on E, write x(nP) = A n (P)/B 2 n (P) in lowest terms. We prove that for the sequence , the term has a primitive divisor for all m ≥ 3. As an application, we give a new method for solving the Diophantine equation y 2 = x 3 + d n under certain conditions.
Key concepts: Divisibility rule, Mathematics, Diophantine equation, Divisor (algebraic geometry), Elliptic curve, Integer (computer science), Sequence (biology), Pure mathematics