Maths that won Fields Medal: number theory diversified, optimal transport

# famous problems and famous mathematicians

# Akshay Venkatesh, Delhi born, Indian-Australian mathematician wins Fields Medal 2018

# Solution to a “nice analysis question for RMO practice”

*The question from a previous blog is re-written here for your convenience. *

**Question:**

How farthest from the edge of a table can a deck of playing cards be stably overhung if the cards are stacked on top of one another? And, how many of them will be overhanging completely away from the edge of the table?

**Solution:**

The figure below shows how two and three cards can be stacked so that the mass of cards is equal on either side of the vertical line passing through the corner of table’s edge in order to just balance them under gravity:

the set of first two cards are arranged as follows (the horizontal lines represents the cards):

the set of three cards are arranged as follows:

We can see that the length of the overhand is a harmonic series of even numbers multiplied by the length of one card, L.

Overhand distance is for 52 cards.

It may be noted that the series if continued to infinity leads to .

That is,

This series is known to diverge as proved below:

First consider, , which is, greater than

, which is greater than . Hence, diverges as we go on adding 1/2 indefinitely.

Now, let

Since diverges, also diverges.

Hence, the “overhang series” also diverges.

This means that the cards can be stacked indefinitely and the overhang distance can reach infinity. However, this will happen very slowly as shown in the table below:

Computing the number of cards that completely overhang off the table needs information about the overhang distance for different number of cards. As shown below in the figure, four cards are required to have one card completely away from the edge of the table. This is because .

(the set of four cards are arranged as follows:)

We can see that the length of the overhang is a harmonic series of even numbers multiplied by the length of one card, L:

Overhang distance = for 52 cards

It may be noted that the series if continued to infinity, leads to

This series is known to diverge. This means that the cards can be stacked indefinitely and the overhang can reach infinity. However, this will happen very slowly as shown in the table below:

Computing the number of cards that completely overhang off the table needs information about the overhang distance for different numbers of cards. As shown in the above schematic figures of cards with overhangs, four cards are required to have one card completely away from the edge of the table. This is because

For the second card to overhang completely, leaving the first card (and hence one half) that is already completely overhung, it is now necessary that

, or

where n needs to be found out. By generating some more data, we can find the value of n to be 11.

For third overhanging card, we need

or

Thus, for m completely overhanging cards, we find n such that

The table below shows these values wherein we see an approximate pattern of arithmetic progression by 7.

By examining the pattern in the table, we can get a simple rule to estimate the number of completely overhanging number of cards m, with an error of utmost one, for n cards stacked.

.

**Reference:**

Popular Problems and Puzzles in Mathematics by Asok Kumar Mallik, IISc Press, Foundation Books.

*Hope you enjoyed the detailed analysis…*

More later,

Nalin Pithwa

# Pick’s theorem: a geometry problem for RMO practice

**Pick’s theorem:**

Consider a square lattice of unit side. A simple polygon (with non-intersecting sides) of any shape is drawn with its vertices at the lattice points. The area of the polygon can be simply obtained as square units, where B is the number of lattice points on the boundary; I = number of lattice points in the interior region of the polygon. **Prove this theorem.**

**Proof:**

Refer Wikipedia 🙂 🙂 🙂

https://en.wikipedia.org/wiki/Pick%27s_theorem

Cheers,

Nalin Pithwa.