Skip to content

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
matteo65 authored Nov 3, 2023
1 parent d4e9c24 commit 940ca09
Showing 1 changed file with 9 additions and 0 deletions.
9 changes: 9 additions & 0 deletions README.md
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.

0 comments on commit 940ca09

Please sign in to comment.