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