Primes in Elliptic Divisibility Sequences-Reference-Cited by-同舟云学术

Primes in Elliptic Divisibility Sequences

Published:2001 Issue: Volume:4 Page:1-13
ISSN:1461-1570
Container-title:LMS Journal of Computation and Mathematics
language:en
Short-container-title:LMS J. Comput. Math.

Author:

Einsiedler Manfred,Everest Graham,Ward Thomas

Abstract

AbstractMorgan Ward pursued the study of elliptic divisibility sequences, originally initiated by Lucas, and Chudnovsky and Chudnovsky subsequently suggested looking at elliptic divisibility sequences for prime appearance. The problem of prime appearance in these sequences is examined here, from both a theoretical and a practical viewpoint. We show calculations, together with a heuristic argument, to suggest that these sequences contain only finitely many primes.

Publisher

Wiley

Subject

Computational Theory and Mathematics,General Mathematics

Reference20 articles.

1. ‘Computer assisted number theory with applications’;Chudnovsky;Number theory,1984

2. A Full Characterisation of Divisibility Sequences

3. Sequences of numbers generated by addition in formal groups and new primality and factorization tests

4. Entropy and the Canonical Height

5. ‘Morphic heights and periodic points’;Einsiedler;New York Number Th. Sem,2001

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Strong divisibility sequences and sieve methods;Mathematika;2024-07-23

2. Looking Back;Springer Biographies;2023

3. Norwich Revisited;Springer Biographies;2023

4. The elliptic net algorithm revisited;Journal of Cryptographic Engineering;2022-11-04

5. The density of the terms in an elliptic divisibility sequence having a fixed G.C.D. with their indices;Journal of Number Theory;2020-02