EECS 203: Discrete Mathematics

Winter 2019
Discussion 13 - Notes

1 Definitions
• Modular Addition

• Modular Subtraction

• Modular Multiplication

• Modular Inverse

• Chinese Remainder Theorem

• Fermat’s Little Theorem

• Extended Euclidean Algorithm

• RSA

1. Exercise 4.1.18 a, c, e, f
Suppose that a and b are integers, a ≡ 11 (mod 19), and b ≡ 3 (mod 19). Find the
integer c with 0 ≤ c ≤ 18 such that

(a) c ≡ 13a (mod 19).

(c) c ≡ a − b (mod 19).

(e) c ≡ 2a2 + 3b2 (mod 19).

(f) c ≡ a3 + 4b3 (mod 19).

1
2. Exercise 4.1.26
Evaluate these quantities.
(a) −17 mod 2

(b) 144 mod 7

(c) −101 mod 13

(d) 199 mod 19

3. Exercise 4.1 Theorem 3

Prove that a ≡ b (mod m) ⇐⇒ a mod m = b mod m

4. Exercise 4.3.6
How many zeros are there at the end of 100! ?

5. Not in Book 1
Find this value of 5203203 (mod 21) without using a calculator. Show all your work !!!!
Hint: Start by looking at small powers of 5n (mod 21) until you find one that equals
1 or -1.

6. Exercise 4.3.50
Show that if a, b, and m are integers such that m ≥ 2 and a ≡ b(mod m), then
gcd(a, m) = gcd(b, m).

7. Not in Book 2
Solve the linear congruence 62x ≡ 41 (mod 135).

8. Exercise 4.4.12 c
Solve the following congruence
(c) 200x ≡ 13mod1001

9. 4.4.33
Use Fermat’s Little Theorem to find 7121 mod 13.

2
10. Exercise 4.6.3
Encrypt the message WATCH YOUR STEP by translating the letters into numbers,
applying the given encryption function, and then translating the numbers back into
letters.

a) f (p) = (p + 14) mod 26

c) f (p) = (7p + 1) mod 26

11. Not in Book 3

Use the Chinese Remainder Theorem construction that was demonstrated in class to
find all solutions to the system of congruences

x≡1 mod 5
x≡2 mod 7
x≡3 mod 9
Note: inverses may be found using any method you want, but should be simplified to
an integer. No further simplification of x is necessary.

12. Not in Book 4

Suppose that we intercepted a suspicious encrypted text:

FVB OHCL ILLU HKKLK AV AOL DHPASPZA

And we suggest to try deciphering it as a shift-cipher encrypted English message.

What is the original text?

13. Not in Book 5

Anna and Captain America are trying to send messages to each other without Volde-
mort understanding so they decide to use the RSA encryption method. Anna wants
to send Captain America the following message:

Hans shot first

If Captain America’s private key, d is 17, and the n used in this RSA system is 21,

a) Find the public key Anna needs to encrypt the message

b) Encrypt the message using the above RSA scheme, 1 letter at a time