
TL;DR
This paper introduces polynomial Cunningham chains, extending the classical prime chains to polynomial sequences, and proves the existence of infinitely many such chains with specific reducibility properties.
Contribution
It constructs explicit polynomial Cunningham chains of any finite length and proves the existence of infinitely many chains of infinite length for both kinds.
Findings
Existence of infinitely many polynomial Cunningham chains of each finite length.
Existence of infinitely many polynomial Cunningham chains of infinite length.
Explicit construction of initial polynomials for these chains.
Abstract
Let . A sequence of prime numbers , such that for all , is called a {\it Cunningham chain} of the first or second kind, depending on whether or -1 respectively. If is the smallest positive integer such that is composite, then we say the chain has length . Although such chains are necessarily finite, it is conjectured that for every positive integer , there are infinitely many Cunningham chains of length . A sequence of polynomials , such that , has positive leading coefficient, is irreducible in , and for all , is defined to be a {\it polynomial Cunningham chain} of the first or second kind, depending on whether or -1 respectively. If is the least positive integer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
