Primes in sequences associated to polynomials (after Lehmer)

Einsiedler, Manfred, Everest, Graham and Ward, Thomas (2000) Primes in sequences associated to polynomials (after Lehmer). LMS Journal of Computation and Mathematics, 3. pp. 125-139. ISSN 1461-1570

[thumbnail of lms2000-004.pdf]
PDF (lms2000-004.pdf) - Published Version
Download (125kB) | Preview
[thumbnail of lehmer.pdf]
PDF (lehmer.pdf) - Published Version
Download (236kB) | Preview


In a paper of 1933, D.H. Lehmer continued Pierce's study of integral sequences associated to polynomials, generalizing the Mersenne sequence. He developed divisibility criteria, and suggested that prime apparition in these sequences -- or in closely related sequences -- would be denser if the polynomials were close to cyclotomic, using a natural measure of closeness. We review briefly some of the main developments since Lehmer's paper, and report on further computational work on these sequences. In particular, we use Mossinghoff's collection of polynomials with smallest known measure to assemble evidence for the distribution of primes in these sequences predicted by standard heuristic arguments. The calculations lend weight to standard conjectures about Mersenne primes, and the use of polynomials with small measure permits much larger numbers of primes to be generated than in the Mersenne case.

Item Type: Article
Faculty \ School: Faculty of Science > School of Mathematics
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 18 Mar 2011 14:48
Last Modified: 15 Dec 2022 01:54

Actions (login required)

View Item View Item