Modulo Calculator
Calculator for calculating the modulo
This function calculates the modulo of two integers.
When dividing integer numbers, it can happen that the division does not work out, leaving a remainder that can not be divided. This remainder is called modulo (from Latin modulus).
To calculate, enter the integer numbers, then click on the 'Calculate' button.
|
Description
The modulo operation (often referred to as "mod") calculates the remainder of a division of two numbers.
Formula:
\(a \ mod \ b=r\)
Where:
- a is the dividend (the number being divided).
- b is the divisor (the number being divided by).
- r is the remainder of the division.
Example
\( 7 : 3 = 2 \ Modulo \ 1\)
or
\(7 \ mod \ 3 = 1\)
Explanation:
7 divided by 3 gives 2 with a remainder of 1.
So 7 mod 3 = 1.
Absolute Change
•
All divisors of an integer
•
Average
•
Binomial formulas
•
Common divisors of two integers
•
Consecutive integers
•
Cross multiplication
•
Diamond problem
•
Digit sum
•
Digital root
•
Direct variation
•
Division with remainder
•
Elementary arithmetic
•
Factorial
•
FOIL Method
•
Inverse cross multiplication
•
Inverse modulo
•
Greatest common divisor
•
Least common multiple
•
Modulo
•
Multiplicative inverse
•
Relative Change
|
|