Polynomial Cunningham chains

DOI10.1016/J.JNT.2011.05.012MaRDI QIDQ640026zbMATH OpenOpenAlexFDO

Authors Lenny Jones

Publication date 12 October 2011

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1104.1579

zbMATH Keywords

sequencesirreducible polynomialsCunningham chains

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Special sequences and polynomials (11B83)

Abstract: Let $epsilonin-1,1$. A sequence of prime numbers $p_1,p_2,p_3,\mathrm{...}$, such that $p_i=2p_{i-1}+epsilon$ for all $i$, is called a {it Cunningham chain} of the first or second kind, depending on whether $epsilon=1$ or -1 respectively. If $k$ is the smallest positive integer such that $2p_k+epsilon$ is composite, then we say the chain has length $k$. Although such chains are necessarily finite, it is conjectured that for every positive integer $k$, there are infinitely many Cunningham chains of length $k$. A sequence of polynomials $f_1(x),f_2(x),\mathrm{...}$, such that $$, $f_1(x)$ has positive leading coefficient, $f_i(x)$ is irreducible in $Q[x]$, and $f_i(x)=x{f}_{i-1}(x)+epsilon$ for all $i$, is defined to be a {it polynomial Cunningham chain} of the first or second kind, depending on whether $epsilon=1$ or -1 respectively. If $k$ is the least positive integer such that $f_{k+1}(x)$ is reducible over $Q$, then we say the chain has length $k$. In this article, for chains of each kind, we explicitly give infinitely many polynomials $f_1(x)$, such that $f_{k+1}(x)$ is the only term in the sequence ${f_i(x)}_{i=1}^{infty}$ that is reducible. As a first corollary, we deduce that there exist infinitely many polynomial Cunningham chains of length $k$ of both kinds, and as a second corollary, we have that, unlike the situation in the integers, there exist infinitely many polynomial Cunningham chains of infinite length of both kinds.

Recommendations

• Corrigendum to ``Polynomial Cunningham chains
• The arithmetic of consecutive polynomial sequences over finite fields
• scientific article; zbMATH DE number 1643954
• scientific article; zbMATH DE number 1186949
• Prime clusters and Cunningham chains

Cites work

• scientific article; zbMATH DE number 1467743 (Why is no real title available?)
• scientific article; zbMATH DE number 861252 (Why is no real title available?)
• scientific article; zbMATH DE number 3303103 (Why is no real title available?)
• On algebraic equations with all but one root in the interior of the unit circle. To my teacher and former colleague Erhard Schmidt on his 75th birthday
• On reducible trinomials. III
• Reducibility of quadrinomials
• Sur certaines hypothèses concernant les nombres premiers

Cited in

(5)

• scientific article; zbMATH DE number 1643954 (Why is no real title available?)
• scientific article; zbMATH DE number 7389746 (Why is no real title available?)
• Corrigendum to ``Polynomial Cunningham chains
• A study of Cunningham bounds through rogue primes
• The arithmetic of consecutive polynomial sequences over finite fields

This page was built for publication: Polynomial Cunningham chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640026)