Carbó-Dorca, Ramon (2022) Mersenne Numbers, Recursive Generation of Natural Numbers, and Counting the Number of Prime Numbers. Applied Mathematics, 13 (06). pp. 538-543. ISSN 2152-7385
![[thumbnail of am_2022062114325661.pdf]](http://publish7promo.com/style/images/fileicons/text.png)
Text
am_2022062114325661.pdf - Published Version
Download (231kB)
Official URL: https://doi.org/10.4236/am.2022.136034
Abstract
A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: MN = 2N – 1, is used to count the number of prime numbers within the precise Mersenne natural number intervals: [0; MN]. 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.
| Item Type: | Article |
|---|---|
| Subjects: | Euro Archives > Mathematical Science |
| Depositing User: | Managing Editor |
| Date Deposited: | 03 Dec 2022 04:22 |
| Last Modified: | 08 Mar 2024 04:03 |
| URI: | http://publish7promo.com/id/eprint/747 |
Actions (login required)
- View Item