Prime divisors of sequences associated to elliptic curves

Julia Robinson has given a first-order definition of the rational integers Z in the rational numbers Q by a formula (\forall \exists \forall \exists)(F=0) where the \forall-quantifiers run over a total of 8 variables, and where F is a polynomial. This implies that the \Sigma_5-theory of Q is undecidable. We prove that a conjecture about elliptic curves provides an interpretation of Z in Q with quantifier complexity \forall \exists, involving only one universally quantified va...

Let E/k(T) be an elliptic curve defined over a rational function field of characteristic zero. Fix a Weierstrass equation for E. For points R in E(k(T)), write x_R=A_R/D_R^2 with relatively prime polynomials A_R(T) and D_R(T) in k[T]. The sequence {D_{nR}) for n \ge 1 is called the ``elliptic divisibility sequence of R.'' Let P,Q in E(k(T)) be independent points. We conjecture that deg (gcd(D_{nP},D_{mQ})) is bounded for m,n \ge 1, and that gcd(D_{nP},D_{nQ}) = gcd(D_{P},D_{Q...

It is shown that there are finitely many perfect powers in an elliptic divisibility sequence whose first term is divisible by 2 or 3. For Mordell curves the same conclusion is shown to hold if the first term is greater than 1. Examples of Mordell curves and families of congruent number curves are given with corresponding elliptic divisibility sequences having no perfect power terms. The proofs combine primitive divisor results with modular methods for Diophantine equations.

We investigate strong divisibility sequences and produce lower and upper bounds for the density of integers in the sequence which only have (somewhat) large prime factors. We focus on the special cases of Fibonacci numbers and elliptic divisibility sequences, discussing the limitations of our methods. At the end of the paper there is an appendix by Sandro Bettin on divisor closed sets, that we use to study the density of prime terms that appear in strong divisibility sequence...

We detail the continued fraction expansion of the square root of the general monic quartic polynomial, noting that each line of the expansion corresponds to addition of the divisor at infinity. We analyse the data yielded by the general expansion. In that way we obtain `elliptic sequences' satisfying Somos relations. I mention several new results on such sequences. The paper includes a detailed `reminder exposition' on continued fractions of quadratic irrationals in function ...

In his `Memoir on Elliptic Divisibility Sequences', Morgan Ward's definition of the said sequences has the remarkable feature that it does not become at all clear until deep into the paper that there exist nontrivial such sequences. Even then, Ward's proof of coherence of his definition relies on displaying a sequence of values of quotients of Weierstra\ss $\sigma$-functions. We give a direct proof of coherence and show, rather more generally, that a sequence defined by a so-...

We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes, including the largest prime currently known whose primality cannot feasibly be proved using classical methods.

Let $P(m)$ denote the greatest prime factor of $m$. For integer $a>1$, M. Ram Murty and S. Wong proved that, under the assumption of the ABC conjecture, $$P(a^n-1)\gg_{\epsilon, a} n^{2-\epsilon}$$ for any $\epsilon>0$. We study analogues results for the corresponding divisibility sequence over the function field $\mathbb{F}_q(t)$ and for some divisibility sequences associated to elliptic curves over the rational field $\mathbb{Q}$.

Let $P$ be a non-torsion point on the elliptic curve $E_{a}: y^{2}=x^{3}+ax$. We show that if $a$ is fourth-power-free and either $n>2$ is even or $n>1$ is odd with $x(P)<0$ or $x(P)$ a perfect square, then the $n$-th element of the elliptic divisibility sequence generated by $P$ always has a primitive divisor.

Let D = (D_n)_{n\ge1} be an elliptic divisibility sequence. We study the set S(D) of indices n satisfying n | D_n. In particular, given an index n in S(D), we explain how to construct elements nd in S(D), where d is either a prime divisor of D_n, or d is the product of the primes in an aliquot cycle for D. We also give bounds for the exceptional indices that are not constructed in this way.