This month’s MathsJam was well attended – we matched last month’s turnout of 11, albeit one of that number was in the form of Ed Bradshaw, the organiser of the Washington DC MathsJam. For Ed, it was 4pm and he was in his office, using Google Plus for a live video connection to a MathsJam halfway around the world. The video connection worked fine, although in a noisy pub we struggled to hear what Ed was saying on my laptop’s tiny speakers, so for some of the evening we used headphones and took it in turns to be in conversation with Ed.
You're reading: Posts Tagged: puzzle
Puzzlebomb – March 2012
Puzzlebomb is a monthly puzzle compendium. Issue 3 of Puzzlebomb, for March 2012, can be found here:
Puzzlebomb – Issue 3 – March 2012
The solutions to Issue 3 can be found here:
Puzzlebomb – Issue 3 – March 2012 – Solutions
Previous issues of Puzzlebomb, and their solutions, can be found here.
Another black and white hats puzzle
A classic maths puzzle involves a line of one hundred prisoners, who have each been given a black or white hat by their nefarious captor, and must each correctly shout out the colour of their hat to win freedom. The twist is that the prisoners don’t know the colour of their own hat, and though they can see the colours of the hats in front of them, they don’t know many of each colour there are overall. They can confer on a strategy beforehand, and the aim is to get as many of them to correctly identify their hat colour as possible. You can find a full explanation here (and in many other places!)
There are several ‘sequels’ to this puzzle, some involving an infinite number of prisoners and requiring the axiom of choice to solve. This post is about a nice variation on the theme that I heard about at a recent MathsJam. It can (just about) be solved without knowledge of higher mathematics, and though it seems impossible at first glance, the prisoners in this situation can in fact save themselves with 100% certainty.
Using a zero-knowledge protocol to prove you can solve a sudoku
I’ve just uploaded to youtube a video I made with Katie Steckles to demonstrate why zero-knowledge protocols exist and how one works.
Katie is a habitual liar, so we followed the zero-knowledge protocol described in the paper, “Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles” which you can download from http://www.mit.edu/~rothblum/papers/sudoku.pdf
By following this protocol, Katie can prove that she isn’t lying to me about being able to solve the puzzle, without revealing anything about how she solved it.
The paper I mentioned, “How to explain zero-knowledge protocols to your children” is an excellent explanation of the ideas behind zero-knowledge proof.
MathsJam Manchester, February 2012
This is a roundup of things which happened at Manchester MathsJam, February 2012.
First, we discuss a puzzle I found on Futility Closet, a blog of curiosities by Greg Ross which is sometimes mathematical. The Martian Census Bureau compiled the marital history of every male and female Martian, living and dead: Never married: 6,823,041; Married once: 7,354,016; Married twice: 1,600,897; Married three times: 171,013; Married four times: 2,682. What’s wrong with these figures?
The months are drawing in
February was two days shorter than January. “I’m worried”, I tweeted, “If this carries on, how long will December 2012 be?”
Another way of looking at this is that February is about 93.5% the length of January, so I asked which would produce a shorter December:
A. losing a fixed 2 days each month; or,
B. each month being 93.5% of the previous.
It’s possible, of course, to simply calculate the answer. However, it is possible to come to an answer as to which is shorter without recourse to such a messy technique.
Under B, we know 93.5% of January is two days, the amount by which February is shorter. If March is 93.5% of February we know this decrease must be less than two days because February was shorter than January. And so on. The decrease in A is always 2 days, but the decrease in B is 2 days in the first month and less for later months. Since the overall decrease has been greater, A gives a shorter December.
I suppose there’s a niggle that we don’t usually allow fractions of days on the calendar, so if you’re going to be all ‘real world’ about it then each month should be rounded and this rounding will occur before the 93.5% is calculated to form the next month. So I suppose we will have to do a messy calculation after all.
Under A, losing 2 days per month for 11 months is 22 days, so December will be 9 days long.
Under B, taking each month to be 93.5% of the previous, and then rounding to the nearest integer in the normal way, I get a sequence for the number of days for each month: 31, 29, 27, 25, 23, 22, 21, 20, 19, 18, 17, 16.
So my December is a full seven days shorter by the ‘fixed two days’ method.
Did you get 14 or 15 days for December? If you simply take each month to be 93.5% of the previous without rounding, you calculate 0.935^11*31 and get December as 14.8 days. You can round this to 15, or take the whole days to get 14, but this requires nonsensical things like 18.5 days in November to have happened on the way.
I feel as though this could be a nice, silly way in at various levels to either some basic arithmetic, exponential decrease, through to boundedness in geometric sequences. Even, into some discussion about translating mathematics to real world answers, as the quick 0.935^11*31 calculation masks a whole mess of unreality along the way.
The Slocum Mechanical Puzzle Collection is now online
The Jerry Slocum Collection of mechanical puzzles embodies a lifetime pursuit of the intriguing and the perplexing. The result is the largest assemblage of its kind in the world, with over 34,000 puzzles. Unlike word or jigsaw puzzles, mechanical puzzles are hand-held objects that must be manipulated to achieve a specific goal. Popular examples include the Rubik’s cube and tangrams. The puzzles in the collection represent centuries of mathematical, social, and recreational history from across five continents. When complete, this database will allow researchers and puzzle enthusiasts to search and browse the entire puzzle collection.
Archivists at Indiana University are publishing photos and descriptions of the 30,000+ puzzles in the collection donated to them by Jerry Slocum. So far just over 24,000 puzzles have been put online. You can filter the database by date, designer, maker, and type of puzzle.