The code here tests 64-bit integers for primality. For 32-bit values it uses hashing and then a single Miller-Rabin test. As values get larger it uses up to two more Miller Rabin rounds, and at the end it uses BPSW (which is one rould of Miller Rabin and then one of Lucas). Compared to other codes that achieve the same I believe that the hash tables used here are compact, and both the programs and the intermediate data used to create them are provided. This may be of interest just to people wanting a C++ implementation of the Lucas test.
35 Reviews
- Powerful Unified Communication Features
- Fast, Easy, Free Setup & Install
- Trusted by 47,000+ Companies in 100 Countries
| Website | https://isprime64.sourceforge.io |
| Tags | Mathematics |
| Features |
|