Chapter 4.

1
Tuesday, January 18, 2011
Homework (Due 1/25/11):
1:55 PM (4.1) 4,6,8,10,14, 20, 32,34
Exam#2 1/27/11

427: Decimal to Binary Binary to Decimal: Hex:

(pg 222 -> Hex to Binary)
Largest power of 2 that goes into 427 1101 Base 16
427 / 256 = 1.668 0-F
1, remainder 171 23 + 22 + 21 + 20 = 86
Hex | Binary
171 / 128 = 1.3359 0 0000
1, remainder 43
1 0001
43/32 = 1.3438 2 0010
1, reminder 11
3 0011
11 / 8=1.375 4 0100
1, remainder 3 5 0101
6 0110
3/2=1.5
1, remainder1 7 0111
8 1000
=110101011
9 1001
A 1010
3.7, #6 B 1011
Find inverse of 2 mod 17 C 1100
(? mod 17) (2 mod 17) = 1 mod 17
1) Find gcd(2, 17) D 1101
a. 17 = 8(2) + 1 E 1110
b. 2 = 2 (1) + 0
F 1111
c. Gcd = 1
2) 1 = 17 - 8(2)
3) 1 = -8(2) mod 17 C5916 = 1100 0101 1001
4) The inverse of 2 mod 17 is -8 mod 17 = 12 + 5 + 9 = 26
5) -8 mod 17 = -8 + 17 mod 17 = 9 mod 17 {00}11 0011 0111
6) 9 mod 17 * 2 mod 17 = 18 mod 17 = 1 3 3 7
(337)16

3.7 # 12: 4.1: Mathematical Induction

Solve Congruence:
2x = 7 mod 17 "Climbing a ladder"
1) Multiply both side by the inverse of 2 mod 17 = 9 mod 17 1) Must be able to get started
2) 18x = 63 mod 17 2) From each rung, you must be able to reach the next rung
a. Divide both sides by 17 mod 17 Example:
3) x = 12 mod 17 Prove by induction that 1 + 2 + 3 + 4…+n = n(n+1)/2 for all integers n >= 1
Base Case: n = 1
Smallest case, show it works for left and right side
RSA Encryption: 1 = 1 (1 + 1) / 2 = 1 Works.
"Public Key Cryptography" Inductive Step:
https:// Assume its true for k (shown in base case) .
Show it is true for k is true for k + 1
15 = 51 + 31 "Top Down Approach"
143 = 111 + 131 We want to prove 1 + 2 + 3…+k + (k + 1) = (k + 1)(k + 2) / 2
Larger numbers, harder k(k+1)/2 + (k+1) = (k+1)(k+2)/2
Multiply each side by 2
A -> 00 k(k+1) + 2k + 2 = (k + 1)(k + 2)
B -> 01 K2 + k + 2k + 2 = (k2 + 3k + 2)
C -> 02 K2 + 3k + 2 = k2 + 3k + 2
D -> 03 By the first principle of mathematical induction, the statement is true for all positive
. integers
.
.
Z -> 25

STOP = (S) + (T) + (O) + (P)

Induction Example 2:

Discrete 1-18 Page 1

.
Z -> 25

STOP = (S) + (T) + (O) + (P)

Induction Example 2:
= (18) + (19) + (14) + (15)
= 1819 + 1415
Prove by induction that 1 + 3 + 5 + 7 + 9 + …+ (2n-1) =
Encode 1819 1415 using p = 43 and q = 59
If n == 1: result = 1
N = p * q = 43 * 59 = 2,537
If n == 2: result = 1 + 3 = 4
E = 13
If n == 3: result = 1 + 3 + 5 = 9
1819 -> 181913 mod 2537 = 2081
If n == 4: result = 1 + 3 + 5 + 7 = 16
1415 -> 141513 mod 2537 = 2182
Prove by induction that 1 + 3 + 5 + 7 + 9 + …+ (2n-1) = n2
Encrypted Message 2081 2182 is sent with n=2537, e = 13
Base Case:
n==1:
Decryption:
Left side = 1
Right side = 12
P - 1 = 42
1 == 1
Q - 1 = 58
Induction Step:
(p-1)(q-1) = 42 * 58 = 2,436
Assume statement is true for k. Show that 'True for k' => 'true for k +1'
Decryption key d is the inverse of 13 mod 2436
1 + 3 + 5 + 7 + 9….+ (2k - 1) + (2(k+1)-1) = (k+1)2
(problem 3.7 #4)
Since it worked for k, the sum of 1 => (2k-1) == k2
Gcd(13, 2436)
K2 + 2(k+1) - 1 = (k+1)2
1) 2436 = 187(13) + 5
K2 + 2k +1 = (k + 1)2
2) 13 = 2(5) + 3
K2 + 2k + 1 = k2 + 2k + 1
3) 5 = 1(3) + 2
By the first principle of mathematical induction, the statement is true for all
4) 3 = 1(2) + 1
integers k >=1
5) 2 = 1(1) + 0
6) Gcd(13, 2436) = 1
Backtracking:
1) 1 = 3 - 1(2)
2) 1 = 3 - 1(5 - 1(3)) = 2(3) - 1(5)
3) 1 = 2(3) - 1(5) = 2(13 - 2(5)) - 1(5) = 2(13) - 5(5)
4) 1 = 2(13) - 5(2436 - 187(13))
5) 1 = 937(13) - 5(2436)
The Inverse of 13 mod 2436 = 937 = decryption key
2081937 mod 2537 = 1819
2182937 mod 2537 = 1415
Public Key (n = 2537, e = 13)
Private key (n = 2537, d=937)

4.1 Induction: Example 3

Prove the power rule from calculus f(x) = xn => f'(x) = nxn-1 d/dx holds true for all positive integers
Base Case:
n == 1
If n ==1, f(x) = x1 = x
Then
f'(x) = 1 = 1 x1 - 1
= 1 * x0
=1
Induction Step:
n == k + 1
f(x) = xk+1, want to show f'(x) = (k+1)xk
**Recall the product Rule: if h(x) = f(x)g(x), h'(x) = f(x)g'(x) + f'(x)g(x)
f(x) = xk+1 = xkx1 = xkx
f'(x) = xk*1 + kxk-1x
= xk + kxk
= (k+1)xk
By the fist principle of mathematical induction, the rule is true for all integers k>= 1

4.1 Induction: Example 4

Prove that 12 + 22 + 32…+ n2 = n(n+1)(2n+1)/6 for all integers n >= 1

Base Case:
n == 1
Left side = 12 = 1
Right side = (1)(1+1)(2(1)+1)/6 = 1(2)(3)/6 = 6/6 = 1

Discrete 1-18 Page 2

 Right side = (1)(1+1)(2(1)+1)/6 = 1(2)(3)/6 = 6/6 = 1
Induction Step:
We want to prove12 + 22 + 32 … + k2 + (k+1)2 = (k+1)(k+2)(2(k+1)+1)/6
12-> k2 = k(k+1)(2k+1)/6
k(k+1)(2k+1)/6 + (k+1)2 = (k+1)(k+2)(2(k+1)+1)/6
k(k+1)(2k+1)/6 + (k+1)2 = (k+1)(K+2)(2k+3)/6
k(2k+1) + 6(k+1) =(k+2)(2k+3)
(2k2+k) + 6K + 6 = (2k2 + 3k + 4k + 6)
2k2 + 7k + 6 = 2k2 + 7k + 6
By the fist principle of mathematical induction, the rule is true for all integers k>= 1

4.1 Induction: Example 5 NOTE:

Multiplying Polynomials:
Prove that 5 | (n5-n) for all n>=0 Pascal's Triangle
Base Case:
n == 0 1
5 | (05-0) <=> 5 | 0 1 1
n == 1 1 2 1
5 | (15-1) == 5 | 0 1 3 3 1
n == 2: 1 4 6 41
5 | (25-2) == 5|30 1 5 10 10 5 1
Induction Step Etc
Assume 5 | (k5-k)
Show that 5 | ((k+1)5-(k+1))
Start with (k+1)5 - (k+1) is divisible by 5
(k+1)5 = (k5+5k4+10k3+10k2+5k+1)
((k+1)5-(k+1)) = k5+5k4+10k3+10k2+5k-k+1-1
= (k5-k) + 5k4+10k3+10k2+5k
(k5-k) is divisible by 5 (by our assumption)
5k4+10k3+10k2+5k are all divisible by 5
By the first principle….

Discrete 1-18 Page 3