A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: M<sub>N</sub> = 2<sup>N</sup> – 1, is used to count the number of prime numbers within the preci...A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: M<sub>N</sub> = 2<sup>N</sup> – 1, is used to count the number of prime numbers within the precise Mersenne natural number intervals: [0;M<sub>N</sub>]. This permits the formulation of an extended twin prime conjecture. Moreover, it is found that the prime numbers subsets contained in Mersenne intervals have cardinalities strongly correlated with the corresponding Mersenne numbers.展开更多
文摘A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: M<sub>N</sub> = 2<sup>N</sup> – 1, is used to count the number of prime numbers within the precise Mersenne natural number intervals: [0;M<sub>N</sub>]. This permits the formulation of an extended twin prime conjecture. Moreover, it is found that the prime numbers subsets contained in Mersenne intervals have cardinalities strongly correlated with the corresponding Mersenne numbers.
