On December 7, 2011, I gave my second talk about the Futurama Theorem during a Plymouth State University Mathematics Seminar. The Futurama Theorem is a theorem about the symmetric group that was developed for and proved in the episode “The Prisoner of Benda” for the TV show Futurama. The theorem was proved by show writer Ken Keeler, who has a PhD in applied mathematics from Harvard.
During the episode, Professor Farnsworth and Amy invent a mind swapping machine and after they swap minds, they realize that the machine cannot be used on the same pair of bodies again. After several characters swap minds, they are confronted with the problem of putting everyone’s mind back where it belongs. The Futurama Theorem proves that regardless of how many mind swaps have been made, all minds can be restored to their original bodies using only two extra people. If you want to know more, check out the slides.
The slides for the second talk are very similar to the first set, but there are a few differences:
- The second talk is shorter. I trimmed a few things from the first talk that were not completely necessary.
- I’ve improved the wording in a few spots.
- In the second talk, multiplication of permutations is right to left.
As with the first talk, I used deck.js to create the slides. This allows you to view the slides directly in your web browser. To advance the slides, just use your arrow keys. Also, note that I used MathJax to typeset all of mathematical notation.