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

    <info>
        <link type="guide" xref="index#equation"/>
    <credit type="translator copyright"><name>Fatih Demir</name><email>kabalak@kabalak.net</email><years>2000.</years></credit><credit type="translator copyright"><name>Görkem Çetin</name><email>gorkem@gelecek.com.tr</email><years>2002/2003.</years></credit><credit type="translator copyright"><name>Barış Çicek</name><email>baris@teamforce.name.tr</email><years>2004, 2008, 2009.</years></credit><credit type="translator copyright"><name>Muhammet Kara</name><email>muhammet.k@gmail.com</email><years>2011.</years></credit><credit type="translator copyright"><name>hsngrms</name><email>dead-bodies-everywhere@hotmail.com</email><years>2012</years></credit><credit type="translator copyright"><name>Atilla Öntaş</name><email>tarakbumba@gmail.com</email><years>2014</years></credit><credit type="translator copyright"><name>Emre FIRAT</name><email>emrefirat93@gmail.com</email><years>2013, 2014, 2015</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>
