Calculateur Modulo
Calculez le reste d'une division — l'opération modulo
Modulo Calculator
Calculate the remainder of a division
Find A mod B
A mod B = A - B x floor(A/B)What is a Modulo Calculator?
A Modulo Calculator is a math tool that finds the remainder of a division. The modulo operation is written as a mod b (or sometimes a % b in programming). It tells you what’s left over when a is divided by b.
For example, when you divide 17 by 5, you get 3 with a remainder of 2. So: 17 mod 5 = 2. The modulo operation returns that remainder.
Modulo is used in many practical situations:
- Determining if a number is even or odd (n mod 2)
- Working with time and cycles (like clocks, repeating patterns)
- Computer science tasks such as hashing, indexing, and cryptography
- Finding repeating patterns in math (modular arithmetic)
This calculator makes it easy to compute remainders quickly, especially with large numbers.
How to Use This Modulo Calculator
- Enter the dividend (A) -- the number you want to divide (example: 17)
- Enter the divisor (B) -- the number you divide by (example: 5)
- Click 'Calculate' -- to compute the modulo result
- Review the result -- the output shows both the remainder (A mod B) and the quotient (how many times B fits into A)
- Try other values -- explore patterns like mod 2, mod 10, or mod 60
Tips:
- The divisor B should not be 0 (division by zero is undefined)
- Modulo is commonly used to 'wrap around' within a range (like 0–59 for minutes)
- If you’re using negative numbers, different systems can handle modulo slightly differently—this calculator follows JavaScript’s convention consistently
Modulo Formulas
Division with Remainder
Any division can be expressed as:
a = b × q + r
a = dividend
b = divisor
q = quotient (whole number result)
r = remainder
Modulo Result
a mod b = r
The remainder from division
Remainder Range
0 ≤ r < |b|
Remainder is always less than the absolute value of b
Common Modulo Patterns
Even / Odd Check
n mod 2
0 → even, 1 → odd
Last Digit
n mod 10
Returns the last digit of n
Time Wrapping
minutes mod 60
Minute-hand position in a cycle
Example Calculations
Example 1: Basic Modulo
Compute: 17 mod 5
Division: 17 ÷ 5 = 3 remainder 2
Check: 5 × 3 = 15, and 17 − 15 = 2
Result: 17 mod 5 = 2
Example 2: Check Even or Odd
Compute: 29 mod 2
Division: 29 ÷ 2 = 14 remainder 1
Reasoning: Remainder is 1 → 29 is odd
Result: 29 mod 2 = 1
Example 3: Modulo 10 (Last Digit)
Compute: 347 mod 10
Division: 347 ÷ 10 = 34 remainder 7
Reasoning: The remainder matches the last digit
Result: 347 mod 10 = 7
Example 4: 'Wrap Around' Time
Problem: A digital clock uses a 12-hour cycle. It’s 9 o’clock now. What time is it in 8 hours?
Calculation: (9 + 8) = 17
Modulo: 17 mod 12 = 5
Result: 5 o’clock
Frequently Asked Questions
What does 'mod' mean?
'Mod' means modulo, which returns the remainder after division. For example, 10 mod 3 = 1 because 10 ÷ 3 leaves a remainder of 1.
Is modulo the same as division?
Not exactly. Division gives the quotient (how many times a number fits), while modulo gives the remainder. You often use them together when you need both the quotient and what’s left over.
Why is modulo useful?
Modulo is useful for repeating cycles (time, rotations, repeating patterns), checking even/odd, limiting values to a range (like 0–59), and many programming and math applications.
What happens if the divisor is 0?
Modulo by 0 is undefined, because division by 0 is undefined. The calculator will not return a result if you enter 0 as the divisor.
How does modulo work with negative numbers?
Different systems define negative modulo differently (some use the sign of the dividend, some the divisor). If you use negative numbers, make sure you understand the convention used by the calculator and keep it consistent in your work.
Want to add this modulo calculator to your website? Get a custom embed code that matches your site's design and keeps visitors engaged.
Qu'est-ce que l'opération modulo ?
L'opération modulo trouve le reste lorsqu'un nombre est divisé par un autre. Elle s'écrit a mod n (ou a % n en programmation) et renvoie ce qui reste après avoir divisé a par n autant de fois que possible. Par exemple, 17 mod 5 = 2 car 17 = 3×5 + 2. Le résultat est toujours un entier non négatif strictement inférieur au diviseur — donc mod 5 donne toujours une valeur entre 0 et 4.
Le modulo est omniprésent en programmation : vérifier si un nombre est pair (n % 2 == 0), faire défiler une liste d'options (index % longueur), construire des fonctions de hachage et l'arithmétique d'horloge (le temps revient à 0 à 12 ou 24). C'est l'une des opérations les plus utiles en informatique et en mathématiques. Ce calculateur prend en charge les entrées positives et négatives et affiche le détail complet du calcul.
Comment utiliser le calculateur modulo
- Entrez le dividende — le nombre à diviser (a).
- Entrez le diviseur — le modulus (n).
- Cliquez sur Calculer.
- Lisez le reste — c'est votre résultat modulo.
Formule et exemples
a mod n = a − n × floor(a / n)
Exemples :
17 mod 5 = 2 (17 = 3×5 + 2)
20 mod 4 = 0 (20 = 5×4 + 0, division exacte)
7 mod 3 = 1 (7 = 2×3 + 1)
Vérification pair/impair :
n mod 2 = 0 → pair
n mod 2 = 1 → impair
Arithmétique d'horloge (12 heures) :
14 mod 12 = 2 → 14h = 2:00 PMLe résultat de a mod n vérifie toujours 0 ≤ résultat < n (pour n positif). Le comportement avec les nombres négatifs varie selon le langage de programmation — certains utilisent la division par le bas (Python), d'autres la division tronquée (C, Java, JavaScript), qui peut produire des restes négatifs.
Exemples concrets
100 mod 7 = 2
100 = 14×7 + 2. Utile pour répartir 100 éléments en 7 groupes — vous auriez 14 groupes complets avec 2 éléments restants.
256 mod 16 = 0
256 est un multiple exact de 16, donc le reste est 0. Cela revient constamment en mathématiques hexadécimales et binaires — les puissances de 2 se divisent entre elles sans reste.
29 mod 12 = 5
Arithmétique d'horloge : 29 heures après midi, il est 5h00 du matin le lendemain. L'opération modulo est ce qui permet aux calculs de temps circulaire de fonctionner.