Modular Arithmetic PDF
Modular Arithmetic PDF
Modular Arithmetic PDF
When one number is divided by another, the modulo operation finds the remainder. It is
denoted by the % symbol.
PROPERTIES
1. (a+b)%c=(a%c+b%c)%c
2. (a∗b)%c=((a%c)∗(b%c))%c
3. (a−b)%c=((a%c)−(b%c)+c)%c
4. (a/b)%c=((a%c)∗(b−1%c))%c
Note: In the last property, b-1 is the multiplicative modulo inverse of b and c.
MODULAR EXPONENTIATION
i.e. A^2 mod C = (A * A) mod C = ((A mod C) * (A mod C)) mod C
7^1 mod 13 = 7
7^2 mod 13 = (7^1 *7^1) mod 13 = (7^1 mod 13 * 7^1 mod 13) mod 13
7^8 mod 13 = (7^4 * 7^4) mod 13 = (7^4 mod 13 * 7^4 mod 13) mod 13
7^256 mod 13 = (7^128 * 7^128) mod 13 = (7^128 mod 13 * 7^128 mod 13) mod 13
7^256 mod 13 = 9
mod 19
Eg. 5117
117=1110101 in binary
117=20 + 22 +24+25 +26
5117 mod 19 = 5(1+4+16+32+64) mod 19
5117 mod 19 = (51 * 54 * 516 * 532 *564 ) mod 19
5^1 mod 19 = 5
5^2 mod 19 = (5^1 * 5^1) mod 19 = (5 * 5) mod 19 = 25 mod 19 = 6
5^4 mod 19 = (5^2 * 5^2) mod 19 = (6 * 6) mod 19 = 36 mod 19= 17
5^8 mod 19 = (5^4 * 5^4) mod 19 = (17 * 17) mod 19 = 289 mod 19 = 4
5^16 mod 19 = (5^8 * 5^8) mod 19 = (5^8 mod 19 * 5^8 mod 19) mod 19
Similarly
5^16 mod 19 = 16
5^32 mod 19 = 9
5^64 mod 19 = 5
5^117 mod 19 = ( 5^1 mod 19 * 5^4 mod 19 * 5^16 mod 19 * 5^32 mod 19 * 5^64 mod
19) mod 19
5^117 mod 19 = 1
Problem 1
Problem 2
Problem 3
Problem 4