Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Mathematics
General Math
Math Proof Training and Practice
(open) Little Fermat Proof
Reply to thread
Message
[QUOTE="fresh_42, post: 6381883, member: 572553"] Very nice. But you could have done the same reasoning on a high school level without Burnside and group action. So if someone wants to try ... No group theory necessary here. Your proof is therefore not really by combinatorics, since they are all hidden in Burnside's Lemma. For all high schoolers who want to try: Distinguish unicoloured chains and those with at least two colours. Then count the possibilities to get a new, different sorting by a shift and group them. Side effect: If you will have done so, you automatically get an insight on how Burnside's Lemma works. [/QUOTE]
Insert quotes…
Post reply
Forums
Mathematics
General Math
Math Proof Training and Practice
(open) Little Fermat Proof
Back
Top