<?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="Integer factorization - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=integer_factorization&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=integer_factorization&amp;p=3">3.Next</a>
</p>
<p>For example,  is a composite number because , but  is a prime number because it cannot be decomposed in this way. If one of the factors is composite, it can in turn be written as a product of smaller factors, for example . Continuing this process until every factor is prime is called <b>prime factorization</b>; the result is always unique up to the order of the factors by the <a href="page.php?w=prime_factorization_theorem">prime factorization theorem</a>.</p>

<p>To factorize a small integer  using mental or pen-and-paper arithmetic, the simplest</p><p>
<a accesskey="1" href="page.php?w=integer_factorization&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=integer_factorization&amp;p=3">3.Next</a>
</p>

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

</card>
</wml>
