2000 character limit reached
Some effectivity results for primitive divisors of elliptic divisibility sequences
Published 9 Jan 2020 in math.NT | (2001.02987v3)
Abstract: Let $P$ be a non-torsion point on an elliptic curve defined over a number field $K$ and consider the sequence ${B_n}_{n\in \mathbb{N}}$ of the denominators of $x(nP)$. We prove that every term of the sequence of the $B_n$ has a primitive divisor for $n$ greater than an effectively computable constant that we will explicitly compute. This constant will depend only on the model defining the curve.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.