Abstract Algebra IBL Wiki

User Tools

Site Tools

Trace:
user:bmwoodruff:20130920

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision 		Previous revision
user:bmwoodruff:20130920 [2013/11/21 10:30]
tarafife 		user:bmwoodruff:20130920 [2013/11/21 10:36] (current)
tarafife
Line 1: Line 1:
  
 [[Problem:AutomorphismsOfASquare2]] [[Problem:AutomorphismsOfASquare2]]
 +{{page>Problem:AutomorphismsOfASquare2#problem}}
  
 [[Problem:Automorphisms Of A Directed Square]] [[Problem:Automorphisms Of A Directed Square]]
 +{{page>Problem:Automorphisms Of A Directed Square#problem}}
  
 [[Problem:Simple Shift Repetition]] [[Problem:Simple Shift Repetition]]
 +{{page>Problem:Simple Shift Repetition#problem}}
  
 [[Problem:Cryptography Reading Assignment]] [[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]] [[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]] [[Problem:Do We Need The Associative Law]]
 +{{page>Problem:Do We Need The Associative Law#problem}}
  
  
user/bmwoodruff/20130920.1385047826.txt.gz ยท Last modified: 2013/11/21 10:30 by tarafife

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