Archive for the ‘Math Education’ Category.

## Childhood Memories

I was browsing my analog archives, my high-school notes, and stumbled upon a couple of problems from a math battle we had.

Puzzle. A square is divided into 100 pieces of the same area, in two ways. Prove that you can find 100 points such that each piece in the first division has a point inside, and each piece in the second division also has a point inside.

Puzzle. There is a finite number of points on a plane. All distances between any pairs of points are distinct. Each point is connected to its closest neighboring point. Prove that each point is connected to no more than 5 points.

Share:

A link is defined as two closed curves in three-dimensional space. The first picture shows an example of a link with one yellow curve and one blue. The linking number is a simple numerical invariant of a link. Intuitively, it represents the number of times that each curve winds around the other. For example, if it is possible to pull the two curves apart, the linking number is zero.

When I studied the linking number, I would look at a picture of a link trying to calculate this number. It was confusing. It only became easy after I started crocheting. For example, the second picture shows the same link as the first but slightly rearranged. I simply slid the yellow loop along the blue one until I could clearly see a piece of the blue loop as a straight segment and the yellow loop circling around it. Now, it is easy to see that the yellow loop winds around the blue one 3 times, making the linking number 3.

The only thing to remember is that while counting the number of windings, I need to consider the direction. It is possible for a loop to wind clockwise and then counterclockwise. In this case, the linking number is the difference between the two.

I crocheted a lot of links, and now my students and I have no problem calculating the linking numbers.

Share:

## Move Two Matches to Get the Largest Number

Puzzle. If you can move exactly two matches, what is the largest possible number you can get?

Many people assume that given that 508 has three digits, the answer also has three digits. They get the number 999 and stop there.

Some students realized they can make an extra 1 out of two matches and gave answers with four digits: 1503, 5051, and 5103.

Another great idea is to take out the two horizontal matches from 0, turning the 0 into 11. For example, one might use the two matches to turn 5 into 8 and get 8118. However, we can combine this idea with the previous one and use the two matches to make a new digit 1 to get 51181.

When I first saw this puzzle several years ago, 51181 was the official answer. But my students went further, much, much further.

Another elegant idea is to rotate the picture and get 81151.

Some students decided that having all the digits be the same height is not very important. One vertical match reads as 1, even if it is half the height. The largest number they got this way was 511811. Combining this idea with flipping the number allows us to get 811511.

However, small-font digits are often used in powers. This train of thought led to a brilliant answer, 511811. This number is way larger than everything we saw before: it has 41 digits. If we combine this idea with rotating the number, we can get 811511, a 43-digit number.

I recently decided to check the Internet again and discovered a chain of videos showing solutions to this puzzle by the same author. He started with a simple solution, 51181, then people left comments in the video with better solutions, so he remade the video. This happened several times. I probably should send him a link to this essay for yet another video.

Here is an interesting solution by one of my students that I haven’t seen anywhere else. The idea is to use scientific notation. The student took two matches from the right side of 0. He used one of them to convert the first digit from 5 to 9 and the second digit from 0 into the letter E. He got 9E8 = 900000000. If we combine this idea with using a small 1, we can get 5E81, an 82-digit number.

Another brilliant idea is using two matches to create a caret symbol representing an exponent. This way, we can get 5^118, which is an 83-digit number. If we combine this idea with the rotation idea, we can get 8^115, a 104-digit number.

If we ignore the relative sizes of the digits, we can have the small digits as the base of the exponent and the larger digits as the power. One of the students suggested 115118, a 5330-digit number. And if we rotate the number, the answer we can get is 118115: the number with 8451 digits. This is a humongous number compared to the mere 3-digit one we started with, to the pathetic 5-digit original solution, and to the pitiful 104-digit previous record. But my students didn’t stop there.

One student suggested snapping two matches and creating a double factorial 505!!, with 575 digits. Combining this with other ideas, we can get 8115!!, a 14102-digit number.

One of my students decided to use two matches from the last digit 8 to create a factorial sign. She glued one of the matches perpendicular to the plane to get 505! in the projection. She even made a picture that you can see below. This number has 1148 digits, and combining this with previous ideas, we can get 5118!, which has 16763 digits. Or even 8115!, which has 28202 digits.

For this puzzle, a factorial works better than a double factorial. Here is my own suggestion: use one of the matches to create a small digit one, and split the other match into a factorial. This way, we can get 81151!, a number with a whooping 363154 digits.

This is an excellent example of a thinking-outside-the-box puzzle. I love this puzzle because it has not one, but many boxes one can think outside off.

Share:

Sometimes I mess with my students. Recently, I gave them the following problem for homework.

This problem is a paradox: students can’t know not to read it unless they read it! I expected my students to explain the paradox, and a couple of them did. But, most of them provided me with an infinite stream of entertainment. Here are some of their answers divided into categories, starting with the apologizing ones, and there were a lot of those:

• Oopsie.
• Too late?
• My apologies.

I wasn’t surprised by the apologies, as this problem is intended to be intimidating. However, other students tried to wiggle out of it:

• Next time, I will ask my parents to read my homework to me.
• A person named Don’t read, in the past tense, “this sentence”. I read this sentence, too!
• I happen to have conveniently forgotten English, and it cannot be proven otherwise.

Yet other students decided to rebel:

• Why not?
• I didn’t.
• You just lost your game.
• I will never read anything again, as it says, “Don’t read.”

Karma is a boomerang, and this problem got me into a pickle. One of the most brilliant and funny solutions possible was to leave the answer box blank, implying that the sentence wasn’t read. However, how would I grade this? What if they just skipped the problem? I decided to err on the students’ side and gave full credit for an empty answer box.

A couple of students made a point of pretending they didn’t read the sentence:

• Which sentence?
• I see an answer box, but there’s no problem.

But I saved the best for last. My favorite answer was the following:

Share:

## A Silent Parrot

Puzzle. “I guarantee,” said the pet-shop clerk, “that this parrot will repeat every word it hears.” A customer bought the parrot but found it wouldn’t speak a single word. Nevertheless, the clerk told the truth. Explain.

• The parrot is deaf.

Indeed, in this case, it is not a lie that the parrot will repeat every word it hears. My students had some other ideas. The following answer differs from the official one by one letter, but the spirit of the solution is the same.

Another idea my students had was to introduce a time component.

• The parrot wasn’t guaranteed to say the lines immediately; it would wait 30 years before repeating any words.
• The parrot only repeated the words in the customer’s absence.

And a couple of outside-of-the-box answers.

• The parrot was a toy and did not have a battery in it.
• The customer mistook the pet-shop owner to say the statement about the parrot when in fact, the parrot was saying it.

Share:

## Move Two Matches

This puzzle was in a homework assignment I gave to my students.

Puzzle. In the given configuration of matches, move two matches to form three squares.

I assume that the intended solution is the one below. Its appeal is that it has three squares of the same size and no dangling matches.

As usual, my students were inventive and suggested many alternative solutions.

• The first picture shows a solution with three squares of different sizes: two small ones and one twice as big.
• The next solution has two big squares and one smaller one.
• The following picture shows three squares of different sizes.
• Since the problem doesn’t forbid forming more than three squares, there are, of course, many solutions with more than three squares. The last picture has six squares.

Share:

## In Search of a Tribonacci Building

The Wythoff array is an array of integers that can be defined through Wythoff’s game. For my purposes, I will skip over Wythoff’s game and define his array using Fibonacci numbers.

You probably heard about binary, ternary, decanary, and other bases. I am sure you know the decanary base: it is our standard decimal system. But, have you ever heard about the Fibonacci base?

Let me define it. Any positive integer can be represented uniquely as a sum of distinct Fibonacci numbers that are not neighbors. For example, 16 is 13 + 3. Now, we just write ones for Fibonacci numbers that we used and zeros for unused Fibonacci numbers, so that the digit corresponding to Fibonacci number 1 is last. (The digit corresponding to Fibonacci number 2 is second to last). Thus, 16 in the Fibonacci base is 100100. The result looks like binary, but it will never have two consecutive ones. Such a representation is called the Zeckendorf representation.

What happens if we add 0 at the end of a number in its Zeckendorf representation? This is like multiplying by 2 in binary. But, in the Fibonacci base, it corresponds to replacing every Fibonacci number in the sum with the next Fibonacci number. The result is called the Fibonacci successor. For example, the Fibonacci successor of 16 has the Zeckendorf representation 1001000 and is equal to 21 + 5 = 26.

Now back to the Wythoff array. The first row consists of the Fibonacci numbers in order. Their Zeckendorf representations look like powers of two in binary. The first column consists of numbers ending in 1 in the Zeckendorf representation, in increasing order. In other words, the Zeckendorf representations of numbers in the first column resemble odd numbers in binary. To finish the definition of the array, each number in the nth column is the Fibonacci successor of a number to its left.

As an example, let’s calculate the first three numbers of the second row. The smallest number that is not a Fibonacci number and looks odd in its Zeckendorf representation is 4, represented as 101 (remember, we are not allowed to have two consecutive ones). We place 4 in the first column of the second row. The next number in the second row has to be the Fibonacci successor of 4, so its Zeckendorf representation has to be 1010. This number equals 5+2 = 7. The Fibonacci successor of 7 is 11, with Zeckendorf representation 10100.

John Conway and Alex Ryba wrote a paper where they studied the Wythoff array. They continued the array to the left and drew walls according to a few rules. Here is a picture of their result. The picture is too small to make out the numbers, but you can see the shape, which looks like the Empire State Building. Oops, I forgot to mention, the paper is called The Extra Fibonacci Series and the Empire State Building.

My last year’s PRIMES STEP senior group (Eric Chen, Adam Ge, Andrew Kalashnikov, Ella Kim, Evin Liang, Mira Lubashev, Matthew Qian, Rohith Raghavan, Benjamin Taycher, and Samuel Wang) studied the Conway-Ryba paper and decided to generalize it to Tribonacci numbers.

Just a reminder. The Tribonacci sequence starts as 0, 0, 1, 1, 2, 4, 7, 13, 24, 44, and continues so that any next term is the sum of the three previous terms. For example, the next term after 44 is 81.

Now we need an analog of the Wythoff array for Tribonacci numbers. My readers might by now guess why I chose the above definition of the Wythoff array. Yes, this definition is perfect for generalizing to Tribonacci numbers.

We start by defining the Tribonacci base. We can represent every integer uniquely as a sum of distinct Tribonacci numbers on the condition that there are no three consecutive Tribonacci numbers in the sum. This is called a Tribonacci representation. We can express it with zeros and ones, and there will never be three ones in a row. For example, 16 can be expressed as a sum of Tribonacci numbers in the following way: 16 = 13 + 2 + 1. Thus, its Tribonacci representation is 10011.

We can define a Tribonacci successor, similarly to the Fibonacci successor, by adding a zero in the Tribonacci representation. For example, the Tribonacci successor of 16 has to have the Tribonacci representation 100110 and is equal to 24 + 4 + 2 = 30.

Now, we define the Tribonacci array similarly to the Wythoff array. The first row of the Tribonacci array consists of distinct Tribonacci numbers in order. The first column consists of integers whose Tribonacci representations end in 1. The number in the nth column is a Tribonacci successor of the number to its left.

We found many cool properties of the Tribonacci array. They are in our paper, Generalizing the Wythoff Array and other Fibonacci Facts to Tribonacci Numbers, posted on the arXiv. Let me give you three examples of these awesome properties.

1. Consider any integer sequence such that the next term is a sum of the three previous terms. We call such sequences Tribonacci-like. One of the cool properties is that, in some sense, the Tribonacci array contains all positive Tribonacci-like sequences. More formally, if a Tribonacci-like sequence has three consecutive positive terms, then the tail of such a sequence has to appear in the Tribonacci array as one of the rows.
2. It follows that multiples of any row in the Tribonacci array have to appear in the array. An awesome fact is that they appear in order.
3. Moreover, when all the numbers of a row are divisible by n, the row number minus 1 is also divisible by n.

It is easy to extend the Tribonacci array to the left, but this extension doesn’t have the same nice properties as the extension of the Wythoff array. So finding an Empire State Building, or any other building, in the Tribonacci array is futile.

Share:

## The Struggles of Chessland

As my readers know, I run a PRIMES STEP program, where we conduct mathematical research with students in grades 6 through 9. Last year, our junior group wrote the paper, The Struggles of Chessland, which is now posted on the arXiv.

This is the funniest paper ever written at PRIMES STEP. In the paper, the King, with his self-centered Queen and their minions, try to protect their lands in the Bermuda triangle, called the Chessland, which consists of square islands of different sizes.

In the first part of their fairy tale, the King, his lazy Queen, and other chess pieces are trying to survey their islands. The first volunteer for this surveying job is the Knight. The Knight starts somewhere on an island and walks around it by using the knight’s moves in chess. The goal is to see every cell, and a Knight can see all cells that are a knight’s move away from where he is standing. In other words, every cell is either visited by the Knight or is one knight’s move away from a visited cell. In mathematical terms, the Knight walks a path that is a domination set on a knight’s graph.

The students found a lot of such paths. The picture shows a surveying path for the Knight for the island of size 7. The students called this pattern a shoelace pattern. They used similar shoelaces to survey any island of size 7 or larger. However, when I look at the picture, I see a cat.

Other chess pieces survey the land too. Funnily, the King surveys better when he is drunk. Do you know why? Take a look at the paper.

After all the islands had been surveyed, enemy spies started to appear in Chessland, and our band of chess pieces tried to trap them. My students invented the rules for trapping enemies. An example of the black Queen being trapped is in the picture below, and the rules are the following. Wherever the black Queen might move, should be under attack by a white queen. Also, white queens can’t directly attack the black Queen, or each other.

Oh! I forgot to mention: the trapping should use as few white queens as possible. Also, if the enemy is not a queen but another kind of chess piece, it can only be trapped by its own kind.

The trapping can be described in terms of graph theory. The black Queen is located at a vertex of the queen’s graph. The white queens should be positioned at vertices in such a way that they are not neighbors of the black Queen or each other. In addition, any vertex that is a neighbor of the black Queen, has to be a neighbor of at least one white queen.

This year’s PRIMES STEP project was a real chess adventure!

Share:

## The Unstoppable Truck Driver

I wrote a lot about the inventiveness of my students. Here is more proof.

Puzzle. A police officer saw a truck driver going the wrong way down a one-way street but didn’t try to stop him. Why?

Many of my students came up with the expected answer:

The truck driver was walking.

They also found some legit ways for a truck driver to not be stopped.

• The police officer was too far away.
• There was construction nearby, so the police officer directed the driver to drive the wrong way.
• The truck was a fire truck responding to an emergency.
• The driver bribed the police officer.
• The driver was a kid playing with a toy truck.

Some more ideas, rather far-fetched.

• The police officer was off duty, so he called another police officer to stop the driver.
• The truck driver was going too fast to stop.
• The police officer was responding to a bank robbery, and stopping the truck driver was not high priority.
• The police officer was driving the wrong way too, and it would be hypocritical to stop the truck driver.
• The street was a dead end, and the only way out was to go the wrong way.

Some funny ones.

• The police officer had a history of hallucinating and thought the truck driver was a figment of his imagination.
• The police officer was a ghost.
• The police officer was the truck driver.
• The police officer was busy eating a donut.
• The truck driver was the police officer’s boss.
• The truck driver was the police officer’s grandma.
Share:

## Dear Parents of Math Geniuses

I often receive letters from parents of math geniuses — “My twelve-year-old is reading an algebraic geometry book: accept him to PRIMES,” or “My ten-year-old finished her calculus course: here is her picture to post on your blog,” or “My two-year-old knows the multiplication table, can you write a research paper with him?” The last letter was a sarcastic extrapolation.

I am happy to hear that there are a lot of math geniuses out there. They are potentially our future PRIMES and PRIMES STEP students. But, it is difficult to impress me. The fact that children know things early doesn’t tell me much. I’ve seen a student who didn’t know arithmetic and managed to pass calculus. I’ve also met a student claiming the full knowledge of fusion categories, which later appeared to be from half-watching a five-minute YouTube video.

There are a lot of products catering to parents who want to bring up geniuses. My grandson received a calculus book for his first birthday: Introductory Calculus For Infants. Ten years later, he still is not ready for calculus.

Back to gifted children. Once a mom brought us her kid, who I can’t forget. The child bragged that he solved 30 thousand math problems. What do you think my first thought was? Actually, I had two first thoughts: 1) Why on Earth would anyone count all the problems they solved? 2) And, what is the difficulty of the problems he solved 30 thousand of?

From time to time, I receive an email from a parent whose child is a true math genius. My answer to this parent is the same as to any other parent: “Let your child apply to our programs. We do a great job at working with math geniuses.”

Our programs’ admissions are done by entrance tests. Surprisingly, or not surprisingly, the heavily advertised kids often do poorly on these tests. It could be that the parents overestimate their children’s abilities. But sometimes, the situation is more interesting and sad: I have seen children who sabotage the entrance tests so as not to be accepted into our programs. We also had students give us hints on their application forms that they were forced to apply.

In the first version of this essay, I wrote funny stories of what these students did. Then, I erased the stories. I do not want the parents to know how their children are trying to free themselves.

Dear parents, do not push your children into our programs. If they do not want to be mathematicians, you are decreasing their chances of getting into a good college. Imagine an admission officer who reads an essay from a student who wants to be a doctor but wastes ten hours a week on a prestigious math research program. Such a student doesn’t qualify as a potential math genius, as their passion lies elsewhere. Nor does this student qualify as a future doctor, as they didn’t do anything to pursue their claimed passion. In the end, the student is written off as a person with weak character.

On the other hand, the students who do want to be in our programs, thrive. They often start breathing mathematics and are extremely successful. Encourage your children to apply to our programs if they have BOTH: the gift for mathematics and the heart for it.

Share: