In the 11th meeting, Daniel and Milligan presented.
Here is the STL file which
Daniel created to visualize the geometric proof without words
giving the sum of alternating powers like 1-2^2+3^2-4^2+5^2....
This was printed out in two different colors, black and red where
the black ones are counted positive and the red ones negative.
Milligan showed us how most puzzles are related to graphs in some way.
Cayley graphs in groups like the Rubik or 15 puzzles. Hamiltonian path
type puzzles or mazes which lead to shortest path problems in graphs.
|
|
