1. The problem statement, all variables and given/known data Proof and show that in Euclid's formula for perfect numbers, n must be prime. 2. Relevant equations (2^(n-1))((2^n)-1)) 3. The attempt at a solution I can show it by plugging in the number but I cannot prove it...any ideas?