feat(prime numbers): add code for Miller–Rabin deterministic and non deterministic primality test
Closed this issue · 1 comments
Ansh-Sarkar commented
Proposal
Add code for the extremely fast primality testing of numbers using the Miller–Rabin algorithm. I will be implementing both the following types of algorithms and possible variations if any
- Deterministic
- Non Deterministic
Would love to work on this issue. Kindly do consider assigning it to me if you think this would be a worthwhile contribution to the repository.
ccgcv commented
Sure, go ahead @Ansh-Sarkar