1. The problem statement, all variables and given/known data Using the Fundamental Theorem of Arithmetic, prove that every positive integer can be written uniquely as a power of 2 and an odd number. 2. Relevant equations 3. The attempt at a solution Since the FTOA states that any integer can be written as a product of primes, then it seems that any positive integer can be of the form 2^i*p^j, where p is a prime <> 2. But to get 1, I would have to have 2^0*p*0 and I'm not sure if that would work.