Mersenne Numbers, Recursive Generation of Natural Numbers, and Counting the Number of Prime Numbers  

作　　者：Ramon Carbó-Dorca Ramon Carbó-Dorca(Institut de Química Computacional i Catàlisi, Universitat de Girona, Campus de Montilivi, Girona (Catalonia), Spain)

机构地区：[1]Institut de Química Computacional i Catàlisi, Universitat de Girona, Campus de Montilivi, Girona (Catalonia), Spain

出　　处：《Applied Mathematics》2022年第6期538-543,共6页应用数学（英文）

摘　　要：A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: M_N = 2^N – 1, is used to count the number of prime numbers within the precise Mersenne natural number intervals: [0;M_N]. 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_N = 2^N – 1, is used to count the number of prime numbers within the precise Mersenne natural number intervals: [0;M_N]. 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.

关 键 词：Mersenne Numbers Recursive Generation of Natural Numbers Mersenne Natural Number Intervals Counting the Number of Prime Numbers in Mersenne Natural Intervals Correlation between Prime Number Set Cardinalities and Mersenne Numbers Extended Twin Prime Number Conjecture 

分 类 号：D432.6[政治法律—政治学]