Solve the Tower of Hanoi puzzle, find the minimum number of moves, and prove your formula by induction.
Discover that n disks need 2 to the power n minus 1 moves, and prove it with mathematical induction.
Discover why the average of two numbers is never less than their geometric mean and use it to solve optimization problems.
1 to 1.7 hr · 3 materialsView projectFind the fastest route on a weighted map by hand, then turn the method into code.
1.2 to 2 hr · 4 materialsView projectCut squares from a sheet to fold an open box, then model its volume and find the cut that holds the most.
60 to 90 min · 7 materialsView projectCode the Fibonacci sequence two ways, compare their speed, and watch the ratio of terms home in on the golden ratio.
1 to 1.7 hr · 3 materialsView projectFlip 10 coins many times, build a histogram of heads, and compare it with the binomial model.
1 to 1.7 hr · 4 materialsView projectRecord how a cup of hot water cools, fit an exponential model, and use it to predict the temperature at a later time.
1 to 2 hr · 6 materialsView projectEduVistaHQ.com · Learn • Explore • Grow