(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Theorem.(Fundamental Theorem of Arithmetic) Ever positive integernhas a prime factorization, which is unique except for reordering of the factors.

2. Relevant equations

6.8 Definition.Aprime factorizationofnexpressesnas a product of powers of distinct primes; the exponent of each prime is itsmultiplicity. We write a prime factorization ofnas n=[tex]\prod[/tex][tex]^{k}_{i=1}[/tex]p_{i}^{ei}.

3. The attempt at a solution

[PLAIN]http://icanhascheezburger.files.wordpress.com/2007/09/128320993454987500dudewaitw.jpg [Broken]

Ifnis a prime, of course it has a prime factorization.n=n^{1}. I'm trying to find out how to construct a general proof.

Supposen=p_{1}^{e1}*p_{2}^{e2}* ... *p_{k}^{ek}

or something. Give me a jump-start.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Fundamental Theorem of Arithmetic

**Physics Forums | Science Articles, Homework Help, Discussion**