Share your repls and programming experiences

← Back to all posts
#WEEKLY 19 Fibonacci prime

I implemented a miller-rabin primality test to determine primality. Uses the num-bigint I implemented a miller-rabin test to determine the primality of the terms. I used the num-bigint crate for an arbitrary sized integer and the rand crate for random numbers. The program can generate the first 24 numbers in under 30 seconds and the first 21 in under one. Note that the time it takes starts from the beginning of the program, and run times may vary significantly due to the code being non-deterministic.