Follow on twitter: @thatsmaths
We open with a simple mathematical puzzle that is easily solved using only elementary reasoning. Imagine a party where some guests are friends while others are unacquainted. Then the following is always true:
No matter how many guests there are at the party, there are
always two guests with the same number of friends present.
If you wish, try proving this before reading on. The proof is outlined at the end of this post.
Complete graphs with 6 to 10 vertices.
Paper-folding is a recurring theme in mathematics. The art of origami is much-loved by many who also enjoy recreational maths. One particular folding problem is remarkably easy to state, but the solution remains elusive:
Given a map with M × N panels, how many different ways can it be folded?
Each panel is considered to be distinct, so two foldings are equivalent only when they have the same vertical sequence of the L = M × N layers.
Continue reading ‘Folding Maps: A Simple but Unsolved Problem’