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

    <info>
        <link type="guide" xref="index#equation"/>
    <credit type="translator copyright"><name>Jonathan Ernst</name><email>jonathan@ernstfamily.ch</email><years>2006</years></credit><credit type="translator copyright"><name>Claude Paroz</name><email>claude@2xlibre.net</email><years>2006-2009</years></credit><credit type="translator copyright"><name>Laurent Coudeur</name><email>laurentc@iol.ie</email><years>2009-2010</years></credit><credit type="translator copyright"><name>Alain Lojewski</name><email>allomervan@gmail.com</email><years>2014</years></credit><credit type="translator copyright"><name>Guillaume Bernard</name><email>associations@guillaume-bernard.fr</email><years>2015-2021</years></credit><credit type="translator copyright"><name>Irénée Thirion</name><email>irenee.thirion@e.email</email><years>2023</years></credit></info>

	<title>Division euclidienne</title>
    
    <p>
    Modulus division is performed using the mod operator or the mod <link xref="function">function</link>.
    </p>
    <example>
    <p>9 mod 5</p>
    <p>
    mod (9;5)
    </p>
    </example>
    <p>
    Modular exponentiation x^y mod p is performed using the modexp <link xref="function">function</link>.
    </p>
    <example>
    <p>
    modexp (9;3;5)
    </p>
    </example>
</page>
