Prove b^n (n > 1), and b is prime:
Proof:
1 is a divisor of b^n for all natural numbers.the sum of all the divisors of b^n not counting 1 is a multiple of b. Adding one gives us a non multiple of b, which in order for b^n to be a perfect number, the divisors must add up to b^n (which should give us a multiple of b of course) and does not.
