Skip to main content

Discrete Mathematical Structures

Exercises 5.2.6 Exercises

5.

These integers represent messages encoded in ASCII as described in SubsectionΒ 5.2.2. Decode these messages.
  1. \(\displaystyle 6582119\)
  2. \(\displaystyle 280991720293\)
  3. \(\displaystyle 311107740793\)
  4. \(\displaystyle 22107779118197813113556726561\)
  5. The following is an integer that is too long to fit in a line.
    \begin{gather*} 1971486178880874921204775823582727213754122745\\ 127854714387549425398830 \end{gather*}

6.

Compute \(12^{321} \bmod{456}\text{.}\) Follow the steps below if you get stuck.
  1. Compute the base \(2\) expansion of \(321\text{.}\)
  2. Check that you got \(321 = (101000001)_2\text{.}\)
  3. Compute the successive powers \(p_i\text{,}\) remembering to reduce mod \(456\text{.}\) Did you notice anything that helps this computation go faster?
  4. Multiply the correct terms together to compute \(12^{321} \bmod{456}\text{.}\)

7.

Compute \(7^{447} \bmod{645}\) using fast exponentiation. Show your work.

8.

Compute \(3^{447} \bmod{645}\) using fast exponentiation. Show your work.

13.

Prove that a positive integer is divisible by \(5\) if and only if the last digit is divisible by \(5\text{.}\)

14.

Prove that a positive integer is divisible by \(3\) if and only if the sum of its decimal digits is divisible by \(3\text{.}\)

15.

Prove that a positive integer is divisible by \(11\) if and only if the alternating sum of its decimal digits is divisible by \(11\text{.}\)