Change the N in find_primes.py
to find primes in different range.
This repository was made to generate the datasets in https://www.kaggle.com/datasets/wellington36/prime-number/data
A Mersenne number is of the form
We tested the primality of the first Mersenne numbers with the codes from this repository to the extent possible with some forms (MR is the Miller-Rabin method)
number | digits | MR (k=1) | MR (k=1000) | Large list of primes | MR (deterministc) | |
---|---|---|---|---|---|---|
3 | 1 | ✔️ | ✔️ | ✔️ | ✔️ | |
7 | 1 | ✔️ | ✔️ | ✔️ | ✔️ | |
31 | 2 | ✔️ | ✔️ | ✔️ | ✔️ | |
127 | 3 | ✔️ | ✔️ | ✔️ | ✔️ | |
8191 | 4 | ✔️ | ✔️ | ✔️ | ✔️ | |
131071 | 6 | ✔️ | ✔️ | ✔️ | ✔️ | |
524287 | 6 | ✔️ | ✔️ | ✔️ | ✔️ | |
21474836 | 8 | ✔️ | ✔️ | ✔️ | ✔️ | |
2305...3951 | 19 | ✔️ | ✔️ | ✔️ | ✔️ | |
6189...2111 | 27 | ✔️ | ✔️ | ✔️ | ✔️ | |
1622...8127 | 33 | ✔️ | ✔️ | ✔️ | ✔️ | |
1701...5727 | 39 | ✔️ | ✔️ | ✔️ | ✔️ | |
6864...7151 | 157 | ✔️ | ✔️ | ✔️ | ✔️ | |
5311...8127 | 183 | ✔️ | ✔️ | ✔️ | ✔️ | |
1040...9087 | 386 | ✔️ | ✔️ | ✔️ | - | |
1475...1007 | 664 | ✔️ | ✔️ | ✔️ | - | |
4460...6351 | 687 | ✔️ | ✔️ | ✔️ | - | |
2591...5071 | 969 | ✔️ | ✔️ | ✔️ | - | |
1907...4991 | 1281 | ✔️ | ✔️ | ✔️ | - | |
2855...0607 | 1332 | ✔️ | ✔️ | ✔️ | - | |
4782...4111 | 2917 | ✔️ | ✔️ | - | - | |
3460...3551 | 2993 | ✔️ | ✔️ | - | - |
'-' indicates when it was not computationally possible to carry out the test, using the machine used.