A sequence of prime numbers {p, 2p+1, 4p+3,...,2n-1(p+1)-1} is called a Cunningham chain. These are finite sequences of prime numbers, for which each element is a Sophie Germain prime. It is conjectured that there are arbitrarily large such Cunningham chains, and these chains form an essential part of the study of Sophie Germain primes. In this paper, we aim to significantly improve existing bounds for the length of Cunningham chains by considering their behaviour in the framework of what we will define as rogueness.
No takes yet. Share an insight, caveat, or question.
Bhardwaj et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: