Modular Division

The modular division is totally different from modular addition, subtraction and multiplication. It also does not exist always.

(a / b) mod m is not equal to ((a mod m) / (b mod m)) mod m.

This is calculated using the following formula:

(a / b) mod m = (a x (inverse of b if exists)) mod m

Modular Arithmetic

Modular arithmetic is the branch of arithmetic mathematics related with the “mod” functionality. Basically, modular arithmetic is related with computation of “mod” of expressions. Expressions may have digits and computational symbols of addition, subtraction, multiplication, division or any other. Here we will discuss briefly about all modular arithmetic operations.

Similar Reads

Quotient Remainder Theorem:

It states that, for any pair of integers a and b (b is positive), there exist two unique integers q and r such that:...

Modular Addition:

Rule for modular addition is:...

Modular Multiplication:

The Rule for modular multiplication is:...

Modular Division:

The modular division is totally different from modular addition, subtraction and multiplication. It also does not exist always....

Modular Inverse:

The modular inverse of a mod m exists only if a and m are relatively prime i.e. gcd(a, m) = 1. Hence, for finding the inverse of a under modulo m, if (a x b) mod m = 1 then b is the modular inverse of a....

Modular Exponentiation:

Finding a^b mod m is the modular exponentiation. There are two approaches for this – recursive and iterative....

Contact Us