# Modular Arithmetic

(合同算術)

## Discrete Mathematics I

### 13th lecture, December 22, 2017

http://www.sw.it.aoyama.ac.jp/2017/Math1/lecture13.html

# Today's Schedule

• Remaining schedule
• Summary and homework for last lecture
• Applications of bitwise operations
• Addition in different numeral systems
• Modular Arithmetic
• Modulo operation
• Student Survey

# Remaining Schedule

• December 22: this lecture
• January 12: 14th lecture (makeup class)
• January 19: 15th lecture
• January 24 to 31: Final exams

About makeup classes: The material in the makeup class is part of the final exam. If you have another makeup class at the same time, please inform the teacher as soon as possible.

# Last Week's Homework

Draw the Hasse diagram of a Boolean algebra of order 4 (16 elements). There will be a deduction if you use the same elements of the group as another student.

Solution: For examples, see handouts of last lecture

# Summary of Algebraic Structures

(hierarchy of objects)

# Applications of Bitwise Operations

• Representation of sets and operations on sets
(finite universal set, each bit position represents one element in the universal set)
• Storage and check of (binary) properties
(finite set of properties, each bit position represents one specific property)
• Detailled operations on data
(example: data transformations, data compression)

Operations work on 8, 16, 32, 64 or more bits concurrently

# Other Bitwise Operations

• Left shift:
• `b << n` in C and many other programming languages
• Shifts each of the bits in `b` by `n` positions to the left (more significant direction)
• `n` bits on the right are set to 0
• The leftmost `n` bits in `b` disappear
• If there is no overflow ('1' bits disappearing to the left), `b << n` is equivalent to b ×2n
• Example: '101 1001' << 5 ⇒ '1011 0010 0000' (in actual program: `89 << 5``2848`)
• Right shift:
• `b >> n` in C and many other programming languages
• Shifts each of the bits in `b` by `n` positions to the right (less significant direction)
• `n` bits on the left are set to 0 or to the value of the leftmost bit in `b`, depending on programming lanugage and data type
• The rightmost `n` bits in `b` disappear
• `b >> n` is equivalent to b / 2n (integer division)
• Example: '101 1001' >> 3 ⇒ '1011' (in actual program: `89 >> 3``11`)

# Applications of Bitwise Operations

• In bitstring a, set bits from mask m:
`a |= m`
• In bitstring a, clear bits from mask m:
`a &= ~m`
• In bitstring a, invert bits from mask m:
`a ^= m`
• In bitstring a, set bit number n:
`a |= (1<<n)` (rightmost bit is number 0)
• In bitstring a, clear bit number n:
`a &= ~(1<<n)` (rightmost bit is number 0)
• In bitstring a, invert bit number n:
`a ^= (1<<n)` (rightmost bit is number 0)

For many more advanced examples, see Hacker's Delight, Henry S. Warren, Jr., Addison-Wesley, 2003

# Addition in Different Numeral Systems

Works the same as in decimal system:

• Progress from least signifinant digit to more significant digits
• Carry over when base (e.g. 10) is reached

Example (base 7):

 Operand 1 3 6 5 1 2 Operand 2 6 0 3 3 4 carry 1 1 1 sum in base 10 1 10 7 8 4 6 sum in base 7 1 13 10 11 4 6 Result 1 3 0 1 4 6

0 1
0 0 1
1 1 10
• For inputs a=a0 and b=b0, calculate
the digit-wise sum (without carry) as s0 = a0 `^` b0,
and the digit-wise carry as c0 = a0 `&` b0
• Setting a1 = s0 and b1 = c0 `<<` 1, repeat until c=0

# Example of Addition Using Bitwise Operations

Example: a0 = 46 = 101110、b0 = 55 = 110111

 x 0 1 2 3 ax (sx-1) 101110 011001 1010101 1000101 bx (cx-1<<1) 110111 1001100 0010000 0100000 sx (a0`^`b0) 011001 1010101 1000101 1100101 = 101 (result) cx (a0`&`b0) 100110 001000 0010000 0000000 = 0 (finished) cx`<<1` 1001100 0010000 0100000 0000000

# Modular Arithmetic

• Discovered and published in 1801 by Gauss
• Universal set is ℤ (integers)
• congruence (equation):

a(mod n) ba - b = qna = q1n + rb = q2n + r ∧ 0 ≦ r < n

• n is called modulus (n≠0)
• r is called residue
• a(mod n) b is also written ab (mod n) or ab (modulo n) or an b

# Congruence Relation

• Each modulus n creates a congruence relation on ℤ
• Congruence relations are equivalence relations
• The equivalence classes are called congruence classes or residue classes
• The representative k of a congruence class is usually 0 ≦ k < n
• The representatives are the result of the modulo operation
(attention: depends on definition for negative numbers)

# Properties of Congruence Equations

• abcda + cb + d (mod n)
• abcda - cb - d (mod n)
• abcdacbd (mod n)
• abambm (mod n)
• But: abcd a / cb / d (mod n)

# Properties of the Modulo Operation

• (a + c) mod n = (a mod n + c mod n) mod n (addition modulo n)
• (a - c) mod n = (a mod n - c mod n) mod n (substraction modulo n)
• (a · c) mod n = (a mod n · c mod n) mod n (multiplication modulo n)

Reason: a(mod n) a mod n, and so on

Where to use: a and c may be very large numbers, but a mod n and c mod n may be much smaller, so calculation becomes easier.

# Modulo Operation

• Operator: `%` (C, Ruby and many other programming languages)、mod (Mathematics)
• Definitions for negative numbers: remainder for negative operands operands always non-negative same sign as divisor same sign as dividend a (dividend) n (divisor) q (a/n) 11 7 1 4 1 4 1 4 -11 7 -2 3 -2 3 -1 -4 11 -7 -1 4 -2 -3 -1 4 -11 -7 2 3 1 -4 1 -4 Programming languages,... Pascal, mathematics, this lecture Ruby, Python, Perl, MS Excel C (ISO 1999), Java, JavaScript, PHP
• In some programming languages (e.g. C before ISO 1999), the result is implementation-defined
• Some programming languages offer more than one function
• Always true: qn+r=a ∧ |r|<|n|
• an ba mod n = b mod n only true for "always non-negative"

See English Wikipedia article on Modulo Operation

# An Example of Using the Modulo Operation

Output some data, three items on a line.

A simple way:

```int items = 0;
for (i=0; i<count; i++) {
/* print out data[i] */
items++;
if (items==3) {
printf("\n");
items = 0;
}
}```

Using the modulo operation:

```for (i=0; i<count; i++) {
/* print out data[i] */
if (i%3 == 2)
printf("\n");
}```

# Congruence and Groups

• Addition modulo n creates a group on the congruence classes (cyclic group)
• If n is prime, multiplication modulo n creates a group of size n-1 on the congruence classes except 0
(used e.g. in Diffie-Hellman encryption) 1 2 3 4 * mod 5 1 2 3 4 2 4 1 3 3 1 4 2 4 3 2 1

# Congruence and Division

Division and inverse for rationals: a/b = ca·1/b = a b-1 = c

Condition for (multiplicative) inverse b-1: b b-1 = 1

Condition for modular multiplicative inverse: bb-1 ≡ 1

n b 0 1 2 3 4 5 6 7
2 - 1
3 - 1 2
4 - 1 - 3
5 - 1 3 2 4
6 - 1 - - - 5
7 - 1 4 5 2 3 6
8 - 1 - 3 - 5 - 7

The modular multiplicative inverse is only defined if n and b are coprime (i.e. GCD is 1)

Various methods to calculate, very time-consuming

a/b (mod n) is defined as a b-1 (mod n)

Example:
3/4 (mod 7) = 3 · 4-1 (mod 7) = 3 · 2 (mod 7) = 6
(Check: 6 · 4 (mod 7) = 24 (mod 7) = 3)

# Application of Congruence: Simple Calculation of Remainder

Example: 216 mod 29 = ?

216 = 25 · 25 · 25 · 2

216 = 25 · 25 · 25 · 2 = 32 · 32 · 32 · 2(mod 29) 3 · 3 · 3 · 2 = 54(mod 29) 25

# Remainder Calculation: More Examples

318 mod 7 = ?

318 = (33)6 = 276 (mod 7) (-1)6 = 1

4110 mod 37 = ?

4110 (mod 37) 410 = 220 = 324 (mod 37) (-5)4 = 252 (mod 37) (-12)2 = (6 · 2)2 = 36 · 4 (mod 37) (-1) · 4 = -4 (mod 37) 33

# Homework

Prepare for final exam

# Student Survey

(授業改善のための学生アンケート)

WEB Survey

お願い: 自由記述に必ず良かった点、問題点を具体的に書きましょう

(悪い例: 発音が分かりにくい; 良い例: さ行が濁っているかどうか分かりにくい)

# Glossary

rotation

reflection

hierarchy

concurrent

shift
シフト
invert

modular arithmetic

congruence (equation)

modulus
residue

modulo operation

congruence relation

congruence class

residue class

cyclic group

modular multiplicative inverse
モジュラー逆数
operator

dividend

divisor

implementation