<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Fundamental theorem of arithmetic - Page 17 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Fundamental_theorem_of_arithmetic&amp;p=16">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Fundamental_theorem_of_arithmetic&amp;p=18">3.Next</a>
</p>
<p>prime factorization, and  differs from every  The former case is also impossible, as, if  is a divisor of  it must be also a divisor of  which is impossible as  and  are distinct primes.</p>

<p>Therefore, there cannot exist a smallest integer with more than a single distinct prime factorization. Every positive integer must either be a prime number itself, which would factor uniquely, or a composite that also factors uniquely into primes, or in the case of the integer , not factor into any prime.</p>

<p><big>Generalizations</big></p>
<p>The first generalization</p><p>
<a accesskey="1" href="page.php?w=Fundamental_theorem_of_arithmetic&amp;p=16">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Fundamental_theorem_of_arithmetic&amp;p=18">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
