This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
problem:the_order_of_a_simple_shift [2013/08/09 18:23] bmwoodruff created |
problem:the_order_of_a_simple_shift [2013/08/14 13:30] (current) bmwoodruff |
||
---|---|---|---|
Line 1: | Line 1: | ||
====== The Order of a Simple Shift ====== | ====== The Order of a Simple Shift ====== | ||
==== Problem ==== | ==== Problem ==== | ||
- | Let $S$ be the set of letters in the roman alphabet. For each $n\in\mathbb{Z}$, | + | Let $S = \{a, |
- | + | - For which $n$ does $\phi_n$ not change the message? | |
+ | - Consider the encryption key $\phi_{9}$, which shifts each letter right 9. If a message had been encrypted using $\phi_9$, then clearly $\phi_{-9}$ would decrypt the message as $\phi_{-9}(\phi_9(s))=s$ for any letter $s$. Give an integer $n$ between 0 and 25 which would decrypt a message that has been encrypted by $\phi_9$. | ||
+ | - Are there any integers $n$ for which the encryption key $\phi_n$ is its own decrpytion key? | ||
+ | - A message has been encoded using the encryption key $\phi_4$. We can apply this encryption key multiple times to obtain $\phi_4^2=\phi_4\circ \phi_4$, $\phi_4^3=\phi_4\circ \phi_4\circ \phi_4$, etc. How many times must you repeatedly apply $\phi_4$ to itself before decrypting the message, i.e. what's the smallest $m$ so that $\phi_4^m$ does not change the message. | ||
+ | |||
+ | FIXME. | ||
---- | ---- | ||
Line 23: | Line 28: | ||
---- | ---- | ||
==== External links ==== | ==== External links ==== | ||
- | * | + | * links |
+ | |||
+ | {{tag> |