- #1
ZZ Specs
- 17
- 0
Is there a theorem or any useful application for knowing the order of a permutation belonging to the symmetric group Sn?
For example,
Lets say σ is a permutation belonging to S5; i.e. σ is a permutation of {1,2,3,4,5}. If we are given that σ^7 = I (the identity permutation), then how can we show that necessarily σ = I ?
Thank you all for your time and help.
For example,
Lets say σ is a permutation belonging to S5; i.e. σ is a permutation of {1,2,3,4,5}. If we are given that σ^7 = I (the identity permutation), then how can we show that necessarily σ = I ?
Thank you all for your time and help.