DownloadThe 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.
Features
- Lucas
- Miller-Rabin
Categories
MathematicsFollow 64-bit prime test
Other Useful Business Software
With Twilio Voice, you can build unique phone call experiences with one API, to create, receive, control and monitor calls with just a few lines of code. Create an engaging voice experience that you can quickly scale and modify with a wide array of customization options and resources.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of 64-bit prime test!