A puzzle for November

BLOG: Heidelberg Laureate Forum

Laureates of mathematics and computer science meet the next generation
Heidelberg Laureate Forum

Earlier this month I was reminded of a lovely maths puzzle – one which I often see shared by recreational mathematicians and maths teachers, to test people’s logical thinking. The puzzle is as follows:

What’s the next number in this sequence?

1 11 21 1211 111221 …

If you’d like some time to go away and think about it, take time now.

Before I go into the answer, I’d like to share the historical origins of this sequence. First introduced and analysed by mathematician John Conway, the sequence connects to important applications in computer encoding, and has teased the brains of countless mathematicians around the world since he first wrote about it in the Archimedeans’ Eureka Magazine back in 1986.

Cover of Eureka magazine issue 46, from January 1986

Have you figured it out yet? If not, it may help you to know that this sequence is known as the ‘Look and Say’ sequence – if you read out each number, as a series of digits rather than a word, it might jump out at you.

The Answer

The terms in the sequence each describe the previous term in the sequence – if you say them out loud. The first term, 1, initialises the sequence; then the next term, ‘one one’ (11), describes that, since it consists of one ‘one’. The next term is ‘two ones’ (21), then ‘one two, one one’ (1211), and so on.

The answer to my puzzle was therefore 312211 (‘three ones, two twos, one one’) and the sequence can be continued similarly. You may have been struggling to find a more mathematical sequence, connected to the values of the numbers – and it could be argued this is less of a mathematical puzzle and more of a linguistic one.

If you’d like a more mathematical challenge, you could content yourself with trying to prove the fact that this sequence can never contain a number larger than a 3, and separately that no entry can never contain the sequence ‘333’.

So it’s a fun mathematical curiosity. But is it mathematically important? As with so much of recreational maths, the answer is ‘maybe’! This sequence is related to a commonly used method in data compression and storage, called run-length encoding.

Efficient Use of Space

It’s often desirable to reduce the amount of computer memory needed to store a piece of information, and for certain data files, reducing their size can be achieved by simply describing what you see, just like in the sequence. For example, if my file consisted of 400 instances of the word ‘hello’, it would take significantly less storage to just store the words “400 instances of the word ‘hello’”; or even, “hello×400”. With pre-agreed conventions, data that contains any amount of repetition – sequences of the same digit, or chunks of data that occur more than once – can be compacted down, rather than writing out the whole thing in full.

Some version of this method has been used since as far back as the 1960s in transmission of TV signals and by fax machines, and has plenty of applications. Similar approaches can be applied to, for example, image files – rather than encoding the colour of every pixel of an image separately, it’s less information to just store the colours and location of regions of similar colour, and this is exploited well by the GIF and PNG image encoding formats.

The amount of space you can save depends heavily on the complexity of the image – so, a GIF file of a simple black-and-white checkerboard would take up much less disk space than a full-colour photo with lots of detail, even if they both have the same size in pixels. This also illustrates that you have to be careful what you apply it to – some data sets actually get larger when run-length encoded!

This is also a very desirable way to compress information – since the original message can be restored in full, without any data loss, it’s called ‘lossless compression’. This is one of the main ‘holy grails’ of data compression – to be able to reduce file size without losing any information.

Conway’s Constant

Conway studied the ‘Look and Say’ sequence, considering the rate of growth of the length of a string and determining a constant \(\lambda = 1.303577269034\ldots\), known as Conway’s constant, which describes the average rate at which the length increases. The exact value of this constant is given by a polynomial of degree 71.

He also has a bit of fun in his column (p.5 onwards) applying ideas behind this simple sequence to a metaphorical set of ‘chemical elements’ by analogy with the atoms that make up the universe. He presents a ‘periodic table’ with a string of 1s, 2s and 3s assigned to each element, playing with how the elements combine and eventually reaching a ‘Cosmological Theorem’ about how such sequences are structured, with a plea for someone to help by finding a shorter proof of his result. From a simple idea to a metaphorical theory about the universe!

You might be wondering what it was that inspired me to tell you about this – actually, it was the exciting (for me) realisation that earlier this month we celebrated 1/11/21 – surely the perfect date to study a sequence that starts 1, 11, 21 (and the last time in a while we’ll be able to!) Thanks to maths teacher Chris Smith for sharing this lovely video and bringing this auspicious date to my attention.

Posted by

is a mathematician based in Manchester, who gives talks and workshops on different areas of maths. She finished her PhD in 2011, and since then has talked about maths in schools, at science festivals, on BBC radio, at music festivals, as part of theatre shows and on the internet. Katie writes blog posts and editorials for The Aperiodical, a semi-regular maths news site.

6 comments

  1. Dr. W ist mathematisch und soziophob genug, um seine Meinung sozusagen zu riskieren :

    1 11 21 1211 111221 […]

    … und zwar so :

    1 11 21 1211 111221 [312211]

    Wobei Dr. Webbaer einräumt auch andere Lösungen zu kennen, sich auch nicht weiter in diesen dankenswerterweise verfügbaren Inhalt eingelesen zu haben, also möglicherweise weiter unten vorgestellte Lösungen nicht kennt.

    Mit freundlichen Grüßen
    Dr. Webbaer (ca. 120 Sekunden, Dr. W ist alt)

  2. Ich kenne das ähnlich gelagerte Rätsel
    1 = 0
    11 = 0
    101 = 1
    161 = 1
    282 = 2
    484 = 4
    686 = 4
    916 = 2

    Auch ein Kompressionsalgorithmus – but a really lossy one

  3. I have a question regarding Eureka Magazine, Page 19, ‘A wicked witch has put a spell on boats…’

    Whenever she calls a number x, all boats with number dividing x will sink…

    Do I understand right – if she calls, say, number 3, all boats numbered 3, 6, 9. 12… will sink – but only as long, as at least one boat with a number lower than 3 will sink?

    In this case, I think, the witch is sunken – she’ll never successfully sink a boat.

    Is the question a pun, or is it simply that my english is even weaker than my mathematical grasp?

    • if she calls, say, number 3, all boats numbered 3, 6, 9. 12… will sink

      Its the other way around. If she calls 12, the boats with the numbers 2, 3, 4, 6 and 12 will sink, if not already did so. At least one of the boats 2, 3, 4 or 6 has to be still on the pond when 12 is called.

  4. Dividing x, not divided by… Of course! I’m not used to english mathematics, and german mathematics is so much different;-)

    Thank you, Joker.

Leave a Reply


E-Mail-Benachrichtigung bei weiteren Kommentaren.
-- Auch möglich: Abo ohne Kommentar. +