Abstract Algebra IBL Wiki

User Tools

Site Tools

Trace: • why_we_need_associative • examples_of_abstract_groups
problem:the_order_of_a_simple_shift

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
problem:the_order_of_a_simple_shift [2013/08/10 11:07]
bmwoodruff 		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 = \{a,b,c,\ldots,z\}$ be the set of letters in the roman alphabet. For each $n\in\mathbb{Z}$, let $\phi_{n}:S\to S$ represent the encryption key that shifts each letter in the alphabet right $n$, where we wrap around from $z$ to $a$ for letters that need to be shifted past $z$.+Let $S = \{a,b,c,\ldots,z\}$ be the set of letters in the roman alphabet. For each $n\in\mathbb{Z}$, let $\phi_{n}:S\to S$ represent the encryption key that shifts each letter in the alphabet right $n$, where we wrap around from $z$ to $a$ for letters that need to be shifted past $z$. So $\phi_3(a)=d$, $\phi_3(b)=3$, and $\phi_3(z)=c$. 
   - For which $n$ does $\phi_n$ not change the message?   - 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$. Can you give an integer $n$ between 0 and 25 which would decrypt 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 the encryption key $\phi_n$ is its own decrpytion key?+  - 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.    - 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.  I will probably be breaking this problem up into two different problems.
  
 ---- ----
Line 29: Line 30:
   * links   * links
  
-{{tag>problem ben}}+{{tag>problem ben fixme}}
  
problem/the_order_of_a_simple_shift.1376147244.txt.gz · Last modified: 2013/08/10 11:07 by bmwoodruff

Page Tools

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
CC Attribution-Share Alike 4.0 International Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki