Some effectivity results for primitive divisors of elliptic divisibility sequences
Reviewed by Pithpith:KFVEH6PIopen to challenge →
classification
math.NT
keywords
constantcurveellipticprimitivesequencewillcomputablecompute
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.