Weekly Challenges

I initially wanted to take the approach where you use the Mersenne Primes to generate perfect numbers (Any Prime of the form (2^k) - 1 where k is prime can be turned into a perfect number by multiplying by 2^(k-1)) but decided against it after realizing that I had no way to verify primes without hardcoding it or adding a sieve.

Fun challenge, almost made me miss my Number Theory class from undergrad...almost.