Question

what is mod ? Explain​

Answer 1

In computing, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another. Given two positive numbers a and n, a modulo n is the remainder of the Euclidean division of a by n, where a is the dividend and n is the divisor.

Answer 2

Answer:

The modulo (or "modulus" or "mod") is the remainder after dividing one number by another. Example: 100 mod 9 equals 1. Because 100/9 = 11 with a remainder of 1. Another example: 14 mod 12 equals 2. Because 14/12 = 1 with a remainder of 2.