Activity Database

Search
Activity Authors
Activity Circles
Click To Sort By
Grade
Audience
  • 1st - 2nd (2)
  • 3rd - 5th (8)
  • 6th - 8th (34)
  • 9th - 12th (36)
  • College Level (34)
  • For Teachers (38)
Topics
Topics
  • Algebra / Arithmetic (13)
  • Combinatorics (11)
  • Geometry (16)
  • Mathematical Games (6)
  • Mathematical Modeling (6)
  • Number Theory (13)
  • Parity / Invariants (1)
  • Probability and Statistics (2)
  • Problem Solving / General (13)
  • Social Justice Mathematics (4)
Supporting Materials
Supporting Materials
  • Facilitator Guides (34)
  • Handouts (13)
  • Lesson Plan (6)
  • Photos & Videos (10)
  • References (11)
  • Virtual Tools (7)
Session Styles
Session Styles
  • Work Backwards (10)
  • Integrates Technology (7)
  • Kinesthetic Element (3)
  • Manipulatives (11)
  • Multiple Representations (15)
  • Problem Posing (16)
  • Problem Sets (21)
  • Try a Smaller Problem (17)
Mathematical Practices
Mathematical Practices
  • MP1 - Make sense of problems and persevere in solving them. (34)
  • MP2 - Reason abstractly and quantitatively. (27)
  • MP3 - Construct viable arguments and critique others' reasoning. (27)
  • MP4 - Model with mathematics. (30)
  • MP5 - Use appropriate tools strategically. (24)
  • MP6 - Attend to precision. (40)
  • MP7 - Look for and make use of structure. (34)
  • MP8 - Look for and express regularity in repeated reasoning. (25)

The Futurama Theorem

By:


In the television show Futurama, Professor Farnsworth and Amy decide to try out their newly finished “Mind-Switcher” invention on themselves. When they try to switch back, they discover a key flaw in the machine’s design: it will not allow the same pair of bodies to be used in the machine more than once. Is there a way to restore their minds back to their original bodies?

The Futurama theorem is a real-life mathematical theorem invented by Futurama writer Ken Keeler (who holds a PhD in applied mathematics), purely for use in the Season 6 episode “The Prisoner of Benda”.

Flipping Pancakes

By:


The Pancake Problem, first posed in 1975, is a sorting problem with connections to computer science and DNA rearrangements, which leads to discussions of algorithms, sequences, and the usefulness of approximations and bounds.

The original problem was first posed by mathematician Jacob Goodman under the pen name “Harry Dweighter” (read it quickly) in 1975, and it has delighted math enthusiasts (including undergraduate Bill Gates) ever since!