2 ms·
Calling it brute force isn't quite right. There is an efficient algorithm for prime determination (Lucas-Lehmer primality test) on Mersenne Primes (numbers of t
by planteen 9y ago
Calling it brute force isn't quite right. There is an efficient algorithm for prime determination (Lucas-Lehmer primality test) on Mersenne Primes (numbers of the form 2^p-1).
https://en.wikipedia.org/wiki/Lucas–Lehmer_primality_test https://en.wikipedia.org/wiki/Lucas–Lehmer_primality_test
- colbyh 9y agoThanks for the reminder! And this is my bad because I was paywalled on my phone and didn't see that it was, in fact, a mersenne prime that was found.