Perfect Number Generator

It calculates perfect even #'s with 2^(p-1)*(2^p - 1) where p and (2^p - 1)%are prime. A subsequent run yields a faster run-time. The code is fully%vectorized and hence cleaner than previous versions of the function.%NB: if (2^p - 1) is a Mersenne...