COT3100

// Exam #3 // Review Exercises A

Here is a list of review exercises. There are times when an exercise will be open ended, allowing you to pursue
multiple aspects of the material. While encompassing some areas we have studied, you should further
supplement your studying by reviewing: your notes, your homework assignments, exercise questions given in
lecture, exercise questions given in discussion sessions, and problems from the chapters in our textbook.

1. Prove if 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑚) and 𝑐 ≡ 𝑑 (𝑚𝑜𝑑 𝑚), where 𝑎, 𝑏, 𝑐, 𝑑 ∈ 𝑍 . and 𝑚 > 1, then 𝑎 − 𝑐 ≡ 𝑏 −

𝑑 (𝑚𝑜𝑑 𝑚).

2. Convert the binary 0110 1000 into its hexadecimal representation [(0110 1000)2 = ( ? )16; show your work].

3. Convert the binary 0110 1000 into its decimal representation [(0110 1000)2 = ( ? )10; show your work].

4. Determine the optimal value for 𝑚 and use Mathematical Induction to prove ∀𝑛 ≥ 𝑚, 𝑃(𝑛):
8
𝑛
6(𝑖 − 1) = = − 1? (𝑛 + 1)
2
9:;

5. Given 𝑃(𝑛): ∀𝑛 ≥ 1, 2 | (𝑛B + 𝑛), determine the optimal value for 𝑚 and use Mathematical Induction to
prove that 𝑃(𝑛) is true.

6. What is the prime factorization of 195 [show your work]?

7. What is 𝑙𝑐𝑚(26, 39) [show your work]?