Difference between revisions of "HW2 Ch5 6 MA453Fall2008walther" - Rhea
User
18.191.165.101
Talk for this IP address
Log in
Actions
View source
History
Recent Changes
Slectures
Squad
Practice
Formulas
Donations
Disclaimer
Home
Print
Revision as of 13:06, 10 September 2008
(
view source
)
Adbishel
(
Talk
)
← Older edit
Revision as of 13:42, 10 September 2008
(
view source
)
Adbishel
(
Talk
)
(Removing all content from page)
Newer edit →
Line 1:
Line 1:
−
Here's a hint (that I found helpful):
−
Consider an element of A_{10} as a permutation written in disjoint
−
cycle notation. The lengths of the cycles must add up to no more than
−
10, since the permutations are of degree 10. Odd cycles have lengths
−
2, 4, 6, 8. Even cycles have lengths 3, 5, 7, 9. Since we're dealing with the
−
alternating group, odd cycles must occur in pairs, otherwise you would
−
have an odd permutation (not an even one). Determine the combination
−
of cycle lengths that add up to no more than 10, form an even
−
permutation, and have the largest LCM.
−
−
Enjoy!
−
−
~A. Bishel
Revision as of 13:42, 10 September 2008
Shortcuts
Help
Main Wiki Page
Random Page
Special Pages
Log in
Search
Alumni Liaison
Followed her dream after having raised her family.
Read more »
Ruth Enoch, PhD Mathematics
Currently Active Pages
x
+
x
Chat
x