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.

Features

  • Lucas
  • Miller-Rabin

Project Activity

See All Activity >

Categories

Mathematics

Follow 64-bit prime test

64-bit prime test Web Site

Other Useful Business Software
MongoDB Atlas runs apps anywhere Icon
MongoDB Atlas runs apps anywhere

Deploy in 115+ regions with the modern database for every enterprise.

MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of 64-bit prime test!

Additional Project Details

Registered

2017-07-15