# Newcastle MathsJam October 2012 Recap

Here’s my recollection of what happened at October’s Newcastle MathsJam. It was a fortnight ago and I’m trying to write quickly, so it might be missing a few things.

David asked what the smallest and biggest “A” series sizes of paper could be. Fudging the aspect ratio a bit, he decided that the smallest bit of paper would be the width of an atom (roughly

David then posed a prisoners-in-hats problem. He’s written about it on his new blog.

### Stepping round a circle

The prisoners-in-hats problem got us talking about sizes of infinities, and David asked this question as a motivating example:

If you walk around a circle, with each step taking you

round at a time, will you eventually have stepped on every point on the circle? ${x}^{\circ}$

Clearly, if you step

I have written in my little notebook that David asked “What’s the point of proof/maths?”. We must’ve discussed it; I assume we came up with some compelling arguments.

In celebration of Martin Gardner’s 98th birthday, I made a hexahexaflexagon from first-principles, using a compass and ruler.

I read out the problem from Tanya Khovanova’s paper, Conway’s Wizards. Sadly, nobody took it on. It’s a very very tricky puzzle.

Sarah and I had a go at making some of the knot patterns from a book I bought at Barter Books, *String Figures of the Tuamotus*. It took a while, but Sarah was more successful than I was. First she made a female turtle…

… which then became a male turtle

And then Sarah graduated to string figure master with this very complicated pattern:

### A couple of coin puzzles

John asked this probability question:

I have

coins. I place each of them in turn in piles. It’s equally likely that I’ll place a coin on any of the existing piles, or start a new pile. How many piles should I expect there to be when I’m done? $N$

We didn’t come up with an answer. David, Stephen and Ji set to work computing numbers for small values of

Stephen and Ji were concentrating too hard to notice me take this picture.

David asked a question about coins. It goes like this:

I have a biased coin, but I don’t know what the bias is. How can I use it to make a fair decision between two choices?

If you want to think about this before reading the solution, here’s your warning that the next sentence will spoil it for you. The solution is to flip the coin twice until you get two different results, and take the result of the first flip as your answer. It works because, if the probability of getting heads is

### Hanging pictures just about safely enough

When David got hold of the wool we’d been using to make the string figures of the Tuamotus, he asked us this:

How do you hang a picture from

nails with a single piece of string, so that removing any one of the nails makes the picture fall? $N$

David showed us the solutions for two and three nails (or fingers of a willing participant in our case), which involve wrapping the string in a particular pattern around the nails. I first saw this trick at a Maths Busking event, but I can never remember the solution. On googling, it turns out the Demaine brothers and others have written a big paper on the subject.

*Somehow*, my pair of scissors ended up with some string tied very tightly to one of the handles. Since we had no other cutting implements, we agreed that David would have to run relativistically quickly near a black hole with the scissors to cut the string off.□

In preparation for my PGF talk the following week, I went through the zero-knowledge sudoku protocol with John.

Finally, we learned that googlewhacks don’t exist any more, because somebody has created two pages each containing every pair of words. I haven’t checked that fact; I hope it isn’t true.

The next Newcastle MathsJam is on the 20th of November, two days after the big MathsJam conference at Wychwood Park. I’m looking forward to both!

## Comments

## Comments

Jan Van lent

For the first coin question, I got the numbers

$1,\frac{3}{2},\frac{23}{12},\frac{41}{18},\dots $

$-\frac{2}{3}+\sqrt{2(n+\frac{1}{3})}$ $n$ increases and it looks like the error is $O({n}^{-1.5})$ .

I think the expression

gives a good approximation for the expected number of piles.

I found it by using a recursion formula for the numbers and some function fitting.

The approximation gets better as

I tried finding an exact formula, but only got as far as an integral form for a generating function.