Caldwell's conjecture for the distribution of Cunningham chain lengths

Fix a natural number kk. For each prime pp, let l(p)l(p) denote the length of its Cunningham chain, and for each prime qq let ord(q;2)\operatorname{ord}(q;2) be the multiplicative order of 22 modulo qq. Define

Bk=2k1q>21min{k,ord(q;2)}/q(1q1)k.B_k=2^{k-1}\prod_{q>2}\frac{1-\min\{k,\operatorname{ord}(q;2)\}/q}{(1-q^{-1})^k}.

Caldwell's conjecture. The number of primes pNp\leq N with l(p)kl(p)\geq k satisfies

pNl(p)k1Bk2Ndx(logx)(log2x)(log2k1x)BkNlogkN.\sum_{\substack{p\leq N\\ l(p)\geq k}}1\sim B_k\int_2^N\frac{dx}{(\log x)(\log 2x)\cdots(\log 2^{k-1}x)}\sim B_k\frac{N}{\log^kN}.

This is the Bateman–Horn prediction specialized to Cunningham chains; the paper presents it as an expectation and uses it to study the maximal chain length.

Sources & referencesView supporting material

Primary source

Yuya Kanado, “The relation between a generalized Fibonacci sequence and the length of Cunningham chains”, arXiv:2205.07650 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.