Search for a tool
Modulo N Calculator

Tool to compute any modulo operation. Modulo is the name of the calculus of the remainder in the Euclidean division. The modulo calculator returns the rest of the integer division.

Results

Modulo N Calculator -

Tag(s) : Arithmetics

Share
dCode and you

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!

Team dCode likes feedback and relevant comments; to get an answer give an email (not published). It is thanks to you that dCode has the best Modulo N Calculator tool. Thank you.

Modulo N Calculator

Mod Calculator A mod N

Modular Exponentiation Calculus a^b mod n

Tool to compute any modulo operation. Modulo is the name of the calculus of the remainder in the Euclidean division. The modulo calculator returns the rest of the integer division.

How to calculate a Modulo A % N?

Method 1: Perform euclidean division and returns the remainder.

Example: Calculate $A=123 \mod N=4$, perform the Euclidean division of $123 / 4$ : $123 = 30 \times 4 + 3$ (the quotient is $30$, and the remainder is $3$). The modulo is the value of the remainder, so $123 \% 4 \equiv 3$.

The negative modulo can be considered (rare), in this case $123 = 31 \times 4 - 1$, so $123 \% 4 \equiv -1$.

dCode uses this method that applies to both large numbers, as point numbers for A. However, N be a natural number.

Method 2: Perform the integer division and calculate the value of the difference.

Example: Calculate $A=123 \mod N=4$, make the division: $123/4 = 30.75$. Keep the integer part $30$, and multiply by $N=4$, $30 \times 4=120$. The difference between $123$ and $120$ is $3$, so $123 \% 4 = 3$.

How to write a modulo?

A modulo calculation can be written differently:

In Mathematics, write it using the $\equiv$ congruence symbol and the keyword mod :

$$123 \ equiv 3 \mod 10$$

For computer, write the % percentage symbol, easily accessible on a keyboard:

$$123 \% 10 = 3$$

In functional programming, for integers there is often the function mod() and for floating point numbers, the function fmod().

On calculators, it is often implemented with the function mod():

$$\mod (123,10) = 3$$

How to calculate a^b mod n?

This calculus is named modular exponentiation, use the dCode page dedicated to modular exponentiation.

Where is the modulo in operators precedence order?

In most computation languages, the modulo operator % has the same precedence as the multiplication or division operations.

Source code

dCode retains ownership of the source code of the script Modulo N Calculator online. Except explicit open source licence (indicated Creative Commons / free), any algorithm, applet, snippet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in any informatic langauge (PHP, Java, C#, Python, Javascript, Matlab, etc.) which dCode owns rights will not be released for free. To download the online Modulo N Calculator script for offline use on PC, iPhone or Android, ask for price quote on contact page !