@article {MATHEDUC.06618939,
author = {Smith, Michael D.},
title = {The parity theorem shuffle.},
year = {2016},
journal = {PRIMUS. Problems, Resources, and Issues in Mathematics Undergraduate Studies},
volume = {26},
number = {1},
issn = {1051-1970},
pages = {19-28},
publisher = {Taylor \& Francis, Philadelphia, PA},
doi = {10.1080/10511970.2015.1075787},
abstract = {Summary: 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.''},
msc2010 = {H45xx},
identifier = {2016e.00783},
}