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

    <info>
        <link type="guide" xref="index#equation"/>
    <credit type="translator copyright"><name>Luis Armando Medina A.</name><email>contacto@luisarmandomedina.com</email><years>2016</years></credit><credit type="translator copyright"><name>Jorge González</name><email>jorgegonz@svn.gnome.org</email><years>2007-2010</years></credit><credit type="translator copyright"><name>Francisco Javier F. Serrador</name><email>serrador@cvs.gnome.org</email><years>2003-2006</years></credit><credit type="translator copyright"><name>Pablo Gonzalo del Campo</name><email>pablodc@bigfoot.com</email><years>2000-2004</years></credit><credit type="translator copyright"><name>Carlos Perelló Marín</name><email>carlos@gnome-db.org</email><years>2000, 2002</years></credit><credit type="translator copyright"><name>Ismael Olea</name><email>ismael@olea.org</email><years>2001</years></credit><credit type="translator copyright"><name>Jorge Carrasquilla Soares</name><email>jorge@conectiva.com.br</email><years>2000</years></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>
