[Math] The harmonic (series) beetle: live illustrations of mathematical theorems

big-listexamplessoft-questionteaching

In my analysis class I use the following problem to illustrate the divergence
of the harmonic series (consider this as a hint for solving it).

Exercise.
A beetle creeps along a 1-meter infinitely elastic tape with constant velocity.
Every hour the tape is lengthened out by 1 meter, and the beetle remains at the
same rate of the tape it has already reached to the moment. Will the beetle ever reach
the end of the tape?

This is not a paradox but a calculation of a mathematically idealised model
"from life". Do you have some other, probably nicer examples which illustrate
some standard but deep results in analysis, algebra, probability, geometry,
and so on, and so on, and so on. Please keep in mind an average undergraduate
student as the audience for your example and allow others to use it in his/her
teaching.

Thank you!

Best Answer

There are all these examples surrounding fixed point theorems. The following is somehow a cliche. Take a sheet of paper, crunch it, and put it on top of its original position. Then there is a point that lies on the vertical of its previous position. This illustrates the fixed point theorem for contractions in Banach spaces.

There are also a lot of examples in probability theory. Here is one related to the harmonic series. In your youth, you may have collected cards depicting soccer players, martians, whatever. There is a finite number of cards to collect, say n. Each packet of corn flakes comes with one of them, at random. And of course you want your mom to buy this precise brand of flakes so as to get the whole collection. May be you have wondered what is the average number of packets she should buy so that you can complete the collection. The answer is

$$ n \sum\limits_{k=1}^n {1 \over k} $$

This is asymptotic to $n\log n + n\gamma+ 1/2$, where $\gamma$ is the Euler constant. This is the simplest mundane example I know involving that constant. So for example, if there are $n=150$ cards to collect, you need to buy an average of 519 cards.