[[Problem:AutomorphismsOfASquare2]]
{{page>Problem:AutomorphismsOfASquare2#problem}}

[[Problem:Automorphisms Of A Directed Square]]
{{page>Problem:Automorphisms Of A Directed Square#problem}}

[[Problem:Simple Shift Repetition]]
{{page>Problem:Simple Shift Repetition#problem}}

[[Problem:Cryptography Reading Assignment]]
{{page>Problem:Cryptography Reading Assignment#problem}}

Once we have a set of permutations, we'd like to be able to combine them to get new permutations.  The previous problem used repetition on simple shift permutations of the alphabet to obtain additional permutations.  The next problem has you show that the composition of any finite collection of permutations on a set is always a permutation. 

[[Problem:The Composition Of Permutations Is A Permutation]]
{{page>Problem:The Composition Of Permutations Is A Permutation#problem}}

[[Problem:Do We Need The Associative Law]]
{{page>Problem:Do We Need The Associative Law#problem}}








{{tag>tarafife ben}}