Generalizing the Futurama Theorem

MaRDI QIDQ6276601zbMATH OpenFDO

Authors Jennifer Elder, Oscar Vega

Publication date 16 August 2016

Mathematics Subject Classification ID

Symmetric groups (20B30) Generators, relations, and presentations of groups (20F05)

Abstract: The 2010 episode of emph{Futurama} titled emph{The Prisoner of Benda} centers around a machine that swaps the brains of any two people who use it. The problem is, once two people use the machine to swap brains with each other, they cannot swap back. In this article, we present a new proof of this theorem and also a generalization of it to what would happen if, instead, the machine swapped cyclically the brains of $p$ characters, where $p$ is prime.

This page was built for publication: Generalizing the Futurama Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6276601)