Abstract
The Parity Theorem states that any permutation can be written as a product of transpositions, but no permutation can be written as a product of both an even number and an odd number of transpositions. Most proofs of the Parity Theorem take several pages of mathematical formalism to complete. This article presents an alternative but equivalent statement of the Parity Theorem, replacing “transposition” with “adjacent transposition,” as well as a proof based on an inversion count technique. To build an intuitive understanding of the concept of inversion and to help students discover the Parity Theorem on their own, this article presents a series of five classroom activities based on the group-building initiative “Telephone Pole Shuffle.”
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
