Course cpsc student summer instructor haotian pang this exam contains pages and questions

Midterm 2	Name:

July 16, 2019

In addition to correctness, you will be marked for neatness, presentation and clarity.

Show all your work! A final answer with no demonstrated work will receive very few marks.

Page	Points	Score
2	6
3	10
4	8
5	8
6	6
7	6
8	6
Total:	50

1. (6 points) Consider the affine cipher with encryption function f(x) = (7x + 5) mod 26.

		July 16, 2019

2. Consider the following statements, where a, b, m ∈ Z and m > 1.

CPSC 2190 – M01	Midterm 2 (Page 4 of 8)	July 16, 2019

		Midterm 2 (Page 5 of 8)	July 16, 2019
6.	(a) (3 points) Use the Euclidean algorithm to find the gcd of 132 and 90.

		July 16, 2019

Hn = 1 + 1 2 + 1 3 + · · · + 1 n=	�

H1 + H2 + · · · + Hn = (n + 1)Hn − n.