Last Time | Next Time |
"If he succeeds in finding a pattern in prime numbers, he will hold the key to every computer in the world."
Definition: If every vertex in a graph is connected to every other (different) vertex by a single arc, we call it a complete graph.
Each number, considered as a complete graph, encompasses all the numbers that go before it:
Name of graph: |
![]() |
|||
Number of arcs: | \(T_0=0=\frac{0(1)}{2}\) | \(T_1=1=\frac{1(2)}{2}\) | \(T_2=3=\frac{2(3)}{2}\) | \(T_3=6=\frac{3(4)}{2}\) |
and we drew a few more (\(K_7\) and \(K_8\)).
Historically, according to our reading Early Concepts of Number and Counting, folks used ideas like
You make a note of whether there is a leftover sheep or not -- maybe you make a mark, like a "1" or a "0". This is all you have to do to communicate the number to the King!
But you must also pay attention to the direction in which you write the marks.
It turns out that The Great Fraudini can read anyone's mind -- so long as they're thinking of a number between 1 and 63, and they're willing to play a little card game with him. So let's see how this works....
So in case you don't have a magic trick up your sleeve, I'm giving you one!
However I want you to think about it before I just give it away. Take a look at your cards, and see if you can figure out how The Great Fraudini is doing it....
What do you notice about the cards? (Look for patterns!)
But I also always tell my students that gambling is foolish, unless you have inside information. So I'm all about giving you the inside information. But generally, and (in particular):
Watch Dave Brubeck's leg, counting out the rhythm....