I had my second puzzle in the January 2015 online puzzle sheet Puzzlebomb, entitled “Arithm’ and clues“. It’s a series of cryptarithm puzzles with the same letters denoting the same numbers throughout, but with none of the words given: instead they’re clued. It’s like a crossword but with arithmetic replacing the grid.
Sometimes I start newcomers to MathsJam on timing puzzles. Here are five classics in increasing order of difficulty and implausibility, each with a distinct flavour. The first is distinctly steaky…
1. Some friends are coming over for a steak dinner. You want to cook three steaks as quickly as possible, but your grill pan only holds two at a time. Each steak must be cooked for five minutes on each side. What is the fastest you can have all three ready? Show that you can’t do any better.
Alas, when this precise situation once arose with my family at home (who says puzzles are never useful?), I was unable to convince my father not to cook the steaks in the obvious order. But at least that meant I got my steak sooner.
I’ve long been a fan of the Gale–Shapley matching algorithm, and related problems, so was happy to see that a Nobel Prize was awarded for it. Having seen Peter Rowlett’s article that laid down the following gauntlet:
“I see ‘Nobel week’ as an opportunity for mathematicians to go in search of the mathematics behind each prize, rather than to retreat and complain about the lack of a prize specifically for mathematics”,
I was surprised that none of the mathsy types in my tiny corner of internet seemed to have noticed that a mathematician won a Nobel prize essentially for mathematics. After growing slightly impatient, I realised I only had myself to blame for not acting earlier, so I sketched a quick news story contribution over at the Aperiodical (it’s short and so reproduced here in full):
Did you have a go at my In their Prime puzzle in Puzzlebomb yet? How about the other puzzles?
If the answer is “Yes”, you can check the July solutions, including the numeric solution to In their Prime. But how did you find the solution? You may have successfully used trial and error, but that’s not usually very enlightening; you may have programmed a computer to do the dirty work for you (the puzzle was hand designed, but I did check the answer was unique with a bit of code). As a responsible puzzle-setter, I came up with the following possible proof of the solution. I’d be interested to hear from anyone who had a different method.
I’ve contributed a one-off family tree puzzle called “In Their Prime” to the July issue of the excellent monthly puzzle publication Puzzlebomb. It’s about an extended family who die when they reach a semiprime (composite of two primes) age determined by their parents’ ‘prime number’ genes. My aim was to design a puzzle with a “How do I get started?” flavour which probably would be lost if there was a sequel without a sufficiently interesting twist.
If you haven’t already read them, there are two posts on the Aperiodical by Paul Taylor explaining the computer creation of and maths behind two puzzles that have also featured in Puzzlebomb:
- The extremely unique fractalphile “Hilbert’s Space-Filling Crossword” (only one non-trivial such puzzle exists).
- The more abundant “Spelling Bees” which have appeared several times in past issues (May, June and the aforementioned July issue), involve finding Hamiltonian paths that spell out a pair of words or phrases.
Also in the May issue, I especially liked “Word Split” a pentomino-based colouring word search (but I cheated by not breaking out the crayons). All issues can be found on the Puzzlebomb section of the Aperiodical.
I’ve written an article for the Aperiodical entitled “Ask a mathematician: where should we live?”.
My partner and I are trying to buy a house. We both work in different places, and neither of us enjoys commuting. How could we decide where to live?
Thank you for your intriguing and entirely imaginary letter. The short and not terribly useful answer would be…
This post has some more technical bits, as it’s aimed mainly at people with an undergraduate-level background in mathematics. I’ve included a historical note on Schreier, because it’s easy to forget that mathematical objects are named after real people.
These five sets (each of which have their elements written in numerical order) are Schreier sets:
The following six sets are not Schreier sets:
Can you spot the simple rule that defines whether a set of numbers is a Schreier set or not?
Jozef Schreier was born 1908/1909 in Lwów (then part of the Austro-Hungarian empire, now in Ukraine) and later based at the university there (whilst it was part of Poland). Schreier was killed in April 1943 during the Second World War in his home town of Drohobycz. In his book “Adventures of a Mathematician“, Stanislaw Ulam wrote about Schreier, his friend and collaborator:
We would meet almost every day, occasionally at the coffee house but more often at my house. His home was in Drohobycz, a little town and petroleum center south of Lwów. What a variety of problems and methods we discussed together! Our work, while still inspired by the methods then current in Lwów, branched into new fields: groups of topological transformations, groups of permutations, pure set theory, general algebra. I believe that some of our papers were among the first to show applications to a wider class of mathematical objects of modern set theoretical methods combined with a more algebraic point of view. We started work on the theory of groupoids, as we called them, or semi-groups, as they are called now.
Schreier was also a major contributor (ten questions) to the now famous Scottish book (an important book of questions, famous at least amongst Banach space theorists, and which you can read in English); in fact, he and Ulam pair were the only undergraduate student participants in the Scottish Cafe, a coffee shop where mathematicians from Lwów met, and scribbled maths directly onto the marble tabletops. The Scottish book was a notebook to save the work from being cleaned away at the end of the day.
The Baire-Schreier-Ulam and Schreier-Ulam theorems both bear Jozef Schreier’s name. He has on occasion been referred to as “Julian Schreier” (possibly by conflating him with Juliusz Schauder?): whereas Ulam’s account, the Portugese Wikipedia article, which seems to have been written by his family, and this journal from the time all name him Jozef (or a variant: Josef/Józef/Joseph). He definitely shouldn’t be confused with the contemporary mathematician Otto Schreier, who specialised in groups.
One of Jozef Schreier’s conjectures is now referenced in computer science literature: inspired by an article of Lewis Carroll, in the 1932 paper “On tournament elimination systems“, he conjectured that to find the second largest number in an unordered list requires at least comparisons, which was later confirmed in the 1960s.
I’ve included a list of some of Schreier’s publications at the end of this article.
In 1930, Schreier constructed a counterexample to a question of Banach and Saks using the following idea:
A (non-empty) subset of the natural numbers is a Schreier set if its size is not larger than its least element.
The collection of all such subsets of is known as the (first) Schreier family. For example: and are all Schreier sets. This definition is the first my PhD supervisor showed me in my very first supervision.
You can think of building Schreier sets by picking the smallest element, say, and then filling the set up with at most strictly greater distinct numbers.
The Schreier family has the following simple properties (that make it useful when defining norms on Banach spaces, especially the Schreier space):
- The singleton is Schreier set for all
- The family is hereditary: each (non-empty) subset of a Schreier set is itself a Schreier set.
- The Schreier family is spreading: if is a Schreier set and for all , then is also a Schreier set. (These don’t necessarily need to be in ascending order).
Schreier and Fibonacci
Many of areas of maths have links to the Fibonacci sequence: here’s one, involving the Schreier sets, that I haven’t seen before.
Define to be all those Schreier sets whose greatest element is . For instance . Then the number of elements the n-th Fibonacci number.