I plan to teach knot theory to my students. So, I made four blue knots which are actually the four simplest non-trivial knots. Then I made the red ones which are mirror images of the blue ones.
Then I fiddled with the figure-eight knots, which are the second ones from the left. Out of all these four types of knots, the figure-eight knot is the only one that is amphichiral: its mirror image is equivalent to itself. It was fun to physically transform the red one to look identical to the blue one. So, I decided to crochet another pair of figure-eight knots for my students to fiddle with.
I grew up relatively poor, but I wasn’t aware of it and didn’t care. In 7th grade, I went to a new school for children gifted in math. Looking back, I realize that most of my classmates there were privileged. My first clue about my own financial disadvantages arrived when my math teacher, Inna Victorovna, offered me several of her old dresses. I do not remember what she said to me exactly, but I remember she was tactful, so much so that I felt comfortable taking the dresses.
In an instant, I was better dressed than I had ever been. I especially loved the brown dress which I wore for my first visit to Gelfand’s seminar.
A few years passed; I went to college and married Andrey. Things got somewhat better financially, but I was still struggling. My mother-in-law, Veronika, was well-off and loved clothes. She had a habit of ordering a new dress from her tailor, every season, four times a year. In Soviet Russia, this was a lot of dresses.
One day, Veronika decided to give me some of her old dresses. Unlike my math teacher, she said something that I will never forget. She told me that she was getting rid of those dresses because they were out of fashion and made her look old. I was in my twenties at the time and didn’t want to look old either. However, I didn’t have much choice in clothes, so I wore the dresses. I hated them.
I usually collect puzzles related to math after each MIT mystery hunt. I just discovered that I never reviewed the 2013 hunt, though I started writing the post. Plus, I knew the puzzles of that year better than other year’s puzzles: I was on the writing team. Not to mention, the hunt had some real gems.
I start with mathematical puzzles:
In the Details by Derek Kisman. This is one of my favorite puzzles ever involving evil fractal word search. I even posted the puzzle and the solution on my blog.
Integers and Sequence by me. I used my number gossip database to include cool facts about numbers. The numbers form sequences, as hinted by the title. (The title had a typo: sequences should be plural.)
Permuted by Victoria de Quehen, David Roe, and Andrew Fiori, with illustrations by Kiersten Brown, Turing machine by Adam Hesterberg, and ideas from Daphna Harel and David Farhi. The puzzle has many mini puzzles related to different areas of mathematics.
Basic Alphametics by David Farhi and Casey McNamara. I love this puzzle and often give it to my students.
50/50 by Derek Kisman; server by Ben Buchwald. This is a multi-layered statistics puzzle with a fantastic design and should be included in statistics books. It was the most difficult puzzle of the hunt. Unfortunately, the link is broken, but luckily, I blogged about this puzzle.
Logic puzzles:
Color Sudoku by Byon Garrabrant and Tanya Khovanova.
Turnary Reasoning by Timothy Chow, Alan Deckelbaum, and Tanya Khovanova. The puzzle looks like a mixture of chess, checkers, and Magic the Gathering.
Paint-by-Symbols by R.M. Baur, based on an idea by Eric Wofsey. As the name suggests, this is a paint-by-numbers puzzle.
Time Conundrum by David Farhi. Many people loved this puzzle.
Portals by Palmer Mebane. Ten interconnected Nikoli-type logic puzzles. It is a very difficult puzzle with a fantastic design; I immensely enjoyed testing it.
Random Walk by Jeremy Sawicki. Another Nikoli-type masterpiece that I enjoyed.
Lineup by Charles Steinhardt and Palmer Mebane. Another paint-by-numbers with a twist.
Agricultural Operations by Palmer Mebane, based on an idea by Dan Zaharopol. Kenken with a mathematical twist. It might be the most mathematical puzzle in the hunt, a masterpiece that I greatly enjoyed.
Lojicomix by Robyn Speer and Alex Rozenshteyn; art by DD Liu.
Computer science puzzles:
This Page Intentionally Left Blank by Dan Gulotta, with some help from Robyn Speer. Another puzzle worthy of textbooks: It covers different ways how information can be hidden.
Halting Problem by Dan Gulotta. You have to analyze programs in different languages: the programs are designed to run for a VERY LONG time.
Evolution by Karen Rustad; idea and some screenshots by Asheesh Laroia. A puzzle about email clients.
Security Theater by Sean Lip. I enjoyed this puzzle that uses various ways to encrypt information.
Open Secrets by Tanya Khovanova and Robyn Speer. A puzzle with many famous ciphers.
Caesar’s Palace by Jason Alonso, with casino-formatting by Robyn Speer, clue phrase by Adam Hesterberg. An encrypted crossword which I greatly enjoyed.
A Regular Crossword by Dan Gulotta, based on an idea by Palmer Mebane. A hexagonal crossword with regular expressions as clues.
A Set of Words by David Farhi. You are given several boggle grids. I loved this puzzle very much.
Czar Cycle by Yasha Berchenko-Kogan. This is a weird puzzle that uses English, Russian, and Greek alphabets.
Misc puzzles:
Substance Abuse by David Reiley and Timothy Chow, with assistance from Jill Sazama, Shrenik Shah, and Glenn Willen.
Puzzle-Regarding Vehicle by Katie Steckles, Paul Taylor, and Ali Lloyd. An interesting and difficult puzzle.
A Walk Around Town by Sean Lip, Ludwig Schmidt, and Freddie Manners, with help from Mary Fortune and Jonathan Lee. The puzzle looks like a walk around town but has more to it. The idea is awesome.
Analogy Farm by Robyn Speer, Adam Hesterberg, and Alan Deckelbaum; additional code by Anthony Lu and John Stumpo. A superb analogy game. I loved it so much that after we solved it, I came back and resolved it myself. I am not sure it works anymore, though.
I Can See For Miles by David Roe, based on an idea by Charles Steinhardt. You are given aerial views of buildings. I usually do not like puzzles that involve googling, but using google maps in this puzzle made me feel like I am flying around the world.
Other puzzles I worked on:
Cambridge Waldo by Tanya Khovanova starring Ben Buchwald, Adam Hesterberg, Yuri Lin, Eric Mannes, and Casey McNamara. The goal of this puzzle was to allow a chance for people to go for a walk around Cambridge. I am not sure we were successful: it could be that people used Google street-views to solve this puzzle.
Lost in Translation Gaetano Schinco, Natalie Baca, and Tanya Khovanova. You are given tangrams.
Linked Pairs by Herman Chau and Rahul Sridhar, with crosswords by Adam Hesterberg, Dan Gulotta, and Jenny Nitishinskaya, Manya Tyutyunik, and Tanya Khovanova. You are given three crossword grids, each with two sets of clues.
Magic: The Tappening by John Wiesemann, with help from Dan Gulotta and Tanya Khovanova.
Below, you can find a lovely problem from the 2016 All-Russian Olympiad suggested by Bogdanov and Knop. I took some liberties translating it.
Problem. King Hiero II of Syracuse has 11 identical-looking metallic ingots. The king knows that the weights of the ingots are equal to 1, 2, …, 11 libras, in some order. He also has a bag, which would be ripped apart if someone were to put more than 11 libras worth of material into it. The king loves the bag and would kill if it was destroyed. Archimedes knows the weights of all the ingots. What is the smallest number of times he needs to use the bag to prove the weight of one of the ingots to the king?
And a bonus question from me.
Bonus. Add one more weighing to prove the weight of three more ingots.
Do you know that I participated in Linguistics Olympiads in high school? They are not well-known in the US, but the Soviet Union has been running them since 1965. The first International Linguistics Olympiad was conducted in 2003, and the US joined in 2007. They are called Computational Linguistics because you are expected to discover some phenomenon in an unfamiliar language on the fly instead of knowing a lot of languages already. The problems mostly need logic and are a good fit for a person who likes mathematics. However, a feel for languages is very helpful.
I do not remember why I started attending the Olympiads, but I remember that there were two sets of problems: more difficult for senior and less difficult for non-senior years. I used to be really good at these Olympiads. When I was in 8th grade, I finished my problems before the time ran out and started the senior problems. I got two awards: first place for non-senior years and second place for senior years. In 9th grade, I got two first-place awards. I didn’t know what to do in 10th grade, which was a senior year at that time in the USSR. I couldn’t get two first-place awards, as I could no longer compete in the non-senior category. I felt ashamed that my result could only be worse than in the previous years, so I just didn’t go.
The prizes were terrific: they gave me tons of rare language books. In the picture, a guy from the jury is carrying my prizes for me. I immediately sold the books at used-books stores for a good price. Looking back, I should have gone to the Olympiad in 10th grade: my winter boots had big holes.
What do you give a mathematician who likes only mathematics if you want to expand her geographical horizon? I just got such a gift: A math book that made me feel that I was in Australia. The book, A Dingo Ate My Math Book: Mathematics from Down Under, written by Burkard Polster and Marty Ross, has lovely essays, nice pictures, and a strong Australian flavor.
2022 is abundant, composite, even, evil, square-free, and untouchable.
In addition, 2022 is the smallest number n such that n, n+1, n+2, and n+3 have the maximal exponents in prime factorization equal 1, 2, 3, and 4 correspondingly. Indeed, 2022 = 2·3·337, 2023 = 7·172, 2024 = 23·11·23, and 2025 = 34·52.
Problem. The numbers 22021 and 52021 are expanded, and their digits are written out consecutively on one page. How many total digits are on the page?
