/Prime-Numbers_Miller-Rabin-Primality-Test

The following programs are two different implementations that calculate how many prime numbers exist between two random numbers that are defined inside the code.One of the implementations is based on the Miller-Rabin algorithm and the other(deterministic) uses specific tricks to minimize the process time.Note that each implementation can take input for numbers upto 4090000000

Primary LanguageCMozilla Public License 2.0MPL-2.0

Watchers