Last Time | Next Time |
So: if you fell, can you get back up? If so, then stick with me; if not, you might want to bail.
As you can see, the Konigsberg bridge graph has 4 vertices of odd degree.
Definition: Planar graphs are graphs that can be drawn such that no two edges intersect. Which of our complete graphs are planar?
But our question of the day is this:
Here are a few of my musings:
My own musing: it's interesting that we seem to be abdicating our arithmetic to machines, and imply that it's not important to do arithmetic anymore. I would say that basic numeracy is tremendously important -- but oftentimes, more important than the exact answer is a good estimate. We could work harder to develop that skill.
Well let it be unsung no more! I hope that you'll enjoy this rendition of
(favorite lyrics: "et cetera, et cetera; ad infinitum; ad astra1; forever and ever")
Today we're going to play Sherlock Holmes, and solve a mystery.
The author, Prof. Buck, guesses that "the document" (actually a clay tablet) comes from the city of Nippur, in what is now Iraq: