Num Theory
Num Theory
Num Theory
Lecture 15-16
1
Importance of Number Theory
2
Divisors
3
Divisors Examples
4
Divisors Examples
5
Divisors Examples
6
Divisors Examples
7
Divisors Examples
8
Divisors Examples
9
Multiples up to given n
11
Divisor Theorem
12
Divisor Theorem
13
Divisor Theorem
14
Divisor Theorem
15
Divisor Theorem
Suppose a|b.
Then there exist m such that b = am.
Multiply both sides by c to get bc = amc = a (mc ).
17
Prime Numbers
18
Fundamental Theorem of Arithmetic
22 = 2·11,
100 = 2·2·5·5,
12 = 2·2·3,
17 = 17
20
Primality Testing
22
Primality Testing
23
Primality Testing
A:
• Don’t try number bigger than n/2
• After trying 2, don’t try any other even
numbers, because know n is odd by this point.
• In general, try only smaller prime numbers
• In fact, only need to try to divide by prime
numbers no larger than n as we’ll see next:
24
Primality Testing
25
Primality Testing
2: Neither is even
3: Sum of digits trick: 1+3+9 = 13, 1+4+3 = 8 so neither divisible
by 3
5: Don’t end in 0 or 5
7: 140 divisible by 7 so neither div. by 7
11: Alternating sum trick: 1-3+9 = 7 so 139 not div by 11. 1-4+3 = 0
so 143 is divisible by 11.
q the
d the
3 quotient
divisor 31 117
93
a the r the
dividend 24 remainder
117 = 31·3 + 24
a = dq + r 27
Division
28
GCD and Relatively Prime
29
GCD and Relatively Prime
1. gcd(11,77) = 11
2. gcd(33,77) = 11
3. gcd(24,36) = 12
4. gcd(24,25) = 1. Therefore 24 and 25 are
relatively prime.
Therefore, gcd(98,420) = 14
31
Least Common Multiple
A:
1. lcm(10,100) = 100
2. lcm(7,5) = 35
3. lcm(9,21) = 63
33
Modular Arithmetic
Q: Compute
1. 113 mod 24
2. -29 mod 7
35
mod function
A: Compute
1. 113 mod 24: 24 113
2. -29 mod 7
36
mod function
A: Compute 4
1. 113 mod 24: 24 113
96
17
2. -29 mod 7
37
mod function
A: Compute 4
1. 113 mod 24: 24 113
96
17
2. -29 mod 7
7 29
38
mod function
A: Compute 4
1. 113 mod 24: 24 113
96
17
2. -29 mod 7
5
7 29
35
6
39
(mod) congruence Formal Definition
• A:
• 3 3 (mod 17) True.
any number is congruent to itself (3-3 = 0,
divisible by all)
• 3 -3 (mod 17) False.
(3-(-3)) = 6 isn’t divisible by 17.
• 172 177 (mod 5) True.
172-177 = -5 is a multiple of 5
• -13 13 (mod 26) True.
-13-13 = -26 divisible by 26.
41
Modular arithmetic harder examples
2. 23
i
10 mod 11
i 4
42
Modular arithmetic harder examples
A: Use the previous identities to help simplify:
1. Using multiplication rules, before multiplying (or
exponentiating) can reduce modulo 102:
43
Modular arithmetic harder examples
A: Use the previous identities to help simplify:
2. Similarly, before taking sum can simplify
modulo 11:
23 i 23 i
10 mod 11 10 (mod11)
i 4 i 4
23 i
(1) (mod 11) 10-(-1)
i 4
(1 1 1 1 ... 1 1)(mod11)
0(mod 11)
45
Caesar Cipher
P m e e t m e a f t e r t h e t o g a p a r t y
C P H H W P H D I WH U WK H WR J D S D U WB
46
Caesar Cipher
• can define transformation as:
abcdefghijklmnopqrstuvwxyz
DEFGHIJKLMNOPQRSTUVWXYZABC
• mathematically give each letter a number
abcdefghij k l m n o p q r s t u v w x y z
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
47
Monoalphabetic Cipher
Plain: abcdefghijklmnopqrstuvwxyz
Cipher: DKVQFIBJWPESCXHTMYAUOLRGZN
Plaintext: ifwewishtoreplaceletters
Ciphertext: WIRFRWAJUHYFTSDVFSFUUFYA
48
Monoalphabetic Cipher
49
Example Cryptanalysis
• given ciphertext:
UZQSOVUOHXMOPVGPOZPEVSGZWSZOPFPESXUDBMETSXAIZ
VUEPHZHMDZSHZOWSFPAPPDTSVPQUZWYMXUZUHSX
EPYEPOPDZSZUFPOMBZWPFUPZHMDJUDTMOHMQ
• count relative letter frequencies
• guess P & Z are e and t
• guess ZW is th and hence ZWP is the
• proceeding with trial and error finally get:
it was disclosed yesterday that several informal but
direct contacts have been made with political
representatives of the viet cong in moscow
50
Thank You
51