<?xml version="1.0" encoding="utf-8"?>
<page xmlns="http://projectmallard.org/1.0/" type="guide" id="factorize" xml:lang="cmn">

    <info>
        <link type="guide" xref="index#equation"/>
    
    <mal:credit xmlns:mal="http://projectmallard.org/1.0/" type="translator copyright">
      <mal:name>Woodman Tuen</mal:name>
      <mal:email>wmtuen@gmail.com</mal:email>
      <mal:years>2005-06</mal:years>
    </mal:credit>
  
    <mal:credit xmlns:mal="http://projectmallard.org/1.0/" type="translator copyright">
      <mal:name>Abel Cheung</mal:name>
      <mal:email>abel@oaka.org</mal:email>
      <mal:years>2003-04</mal:years>
    </mal:credit>
  
    <mal:credit xmlns:mal="http://projectmallard.org/1.0/" type="translator copyright">
      <mal:name>趙惟倫</mal:name>
      <mal:email>bluebat@member.fsf.org</mal:email>
      <mal:years>2013</mal:years>
    </mal:credit>
  </info>

	<title>Factorization</title>

    <p>
    You can factorize the number currently displayed by pressing <keyseq><key>Ctrl</key><key>F</key></keyseq> or by pressing the <gui>fact</gui> button.
    This button is visible in <link xref="mouse">programming mode</link>.
    </p>
    <p>
    To factorize integers bigger than 2^64 the Miller-Rabin primality test and Pollard's rho algorithm are used.
    </p>
</page>
