-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
9 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,2 +1,11 @@ | ||
# mzpp19 | ||
High performance palindromic prime number generator | ||
|
||
It finds and prints all palindrome prime between 0 and 2^64-1 | ||
The output is in according b-files format (https://oeis.org/) | ||
. | ||
In order to generate the prime numbers it uses an efficient implementation of the Sieve of Eratosthenes | ||
|
||
**About palindrome prime numbers** | ||
All palindromic prime numbers have odd lengths, except the prime number 11. | ||
Since 2^64 == 18446744073709551616 which is 20 digits long, we have that 64-bit palindromic prime numbers are at most 19 digits long. |