Saw this problem from the 2019 EGMO last week and though it would be a great one to share with kids:
My older son was working on something else tonight, so I talked through the problem with my younger son (he’s in 7th grade). The aim of the project tonight was not to solve the problem, but just to have him play around with a few simple cases and see if he could take a guess at the answer.
I started by just sharing the problem and making sure he understood the ideas and the constraints:
Having looked at the 2×2 case in the prior video, we moved on to the 4×4 case in this video. He had some pretty interesting ideas about how to check if we’d found the maximum number of dominoes:
Now that we’d satisfied ourselves with the 4×4 case, we moved to the 6×6 case. This case is a little harder, but still accessible to kids. Here’s his first attempt at a solution – the trouble is that we weren’t sure if it used the maximum number of dominoes:
It took a bit more experimenting to see that we’d used the most dominoes we could in the last video, and you can see him starting to understand some of the patterns in the problem as he experiments.
By the end of this video he guessed that the maximum number for the 8×8 grid would be 10.
The final challenge was an 8×8 grid. In the first attempt at filling in the board with dominoes we kept getting stuck – but his thoughts about the problem are very interesting:
With one more try through the 8×8 board we were able to fit 10 – yay!
This is a great problem to share with kids. Again, even if they can’t get all the way to understanding the general solution, there are plenty of things they can play with and understand – and also tons of ways to approach the problem!
We had a snow day today and I finally got around to sharing a neat problem from the 2017 Putnam Exam with the boys.
When I first saw the problem I thought it would be absolutely terrific to share with kids:
I started off the project today by having them read the problem and spending a little bit of time playing around:
After the initial conversation the boys, I triehd to start getting a bit more precise. The first sequence of numbers they knew was in the set was 2, 7, 12, 17, . . . .
They were not sure if 4 was in the set or not. My first challenge problem to them was to show that if 4 was in the set, then 3 would be in the set.
My next challenge question was whether or not 1 would be in the set.
Now we moved on to one of the number theory aspects of the problem – is 5 in the set?
During this conversation my younger son noticed that we had found a number that was 1 mod 5.
Finally, we talked through how you could find 6 from the number my son noticed in the last video.
I’m really happy with how this project went. This problem is not one (obviously) that I would expect the kids to be able to solve on their own, but most of the steps necessary to solve the problem are accessible to kids. It was really neat to hear their ideas along the way.
I really enjoy using old AMC problems to talk about math with the boys.
These two problems gave my older son some trouble today:
Tonight I had a chance to talk through these problems with them.
Here’s the probability problem:
Here’s the GCD problem:
My son had a little trouble with this problem from the 2009 AMC 10 B yesterday:
I should him how to solve the problem a few different ways – including by folding!
One of the ways I talked about was finding a rough answer by approximating by the fraction 9/4. We found this number by looking at a calculator and seeing that
As I thought about the problem more last night, I realized that 9/4 is part of the continued fraction approximation for . The first couple of approximations that you find using continued fractions are:
2, 9/4, 38/17, and 161/72.
If I approximate the hypotenuse of the original right triangle with those numbers, I get the following approximations for the length of BD, which are all ratios of consecutive Fibonacci numbers:
If you are familiar with continued fractions and especially the continued fraction approximations for the golden ratio, the emergence of the Fibonacci numbers probably isn’t a huge surprise. I missed it the first time, though, and think that students might really enjoy seeing this little Fibonacci surprise.
This problem (#22 from the 2014 AMC 10a) gave my son some trouble this morning:
We ended up having a nice talk about the problem this morning. To see if the ideas really sunk in, I asked him to talk through the solution tonight, and he did a nice job:
After we finished, I wanted to go back to the 2014 AMC 10 and just happened to notice that google was also showing that Art of Problem Solving had a video about the problem. So, I thought it would be fun to watch Richard Rusczyk’s solution. Turned out to be a lucky decision since his solution was totally different than the one we found:
It was neat to see this second solution – I learned a lot about 15-75-90 triangles today!
My son was working on a few old AMC 10 problems yesterday and problem 17 from the 2016 AMC 10a gave him some trouble:
I thought this would be a nice problem to go through with him. We started by talking through the problem to make sure that he understood it:
In the last video he had the idea to check the cases with 10 and 15 balls in the bucket, so we went through those cases:
Now we tried to figure out what was happening. He was having some difficulty seeing the pattern, so I spent this video trying to help him see the pattern. The trouble for me was that the pattern was 0, 1, 2, . . ., so it was hard to find a good hint.
Finally he worked through the algebraic expression he found in the last video:
This isn’t one of the “wow, this is a great problem” AMC problems, but I still like it. To solve it you have to bring in a few different ideas, and combining those different ideas is what seemed to give my son some trouble. Hopefully going through this problem was valuable for him.
My older son is learning trig out of Art of Problem Solving’s Precalculus book this year. Yesterday he was working on the “sum to product” section, which derives rules for expressions like Cos(x) + Cos(y). It reminded me of one of my all time favorite math contest problems:
Today I thought I would show him my solution to that problem. What we go through probably isn’t the best or easiest solution, but I think it is an instructive solution for someone learning trig.
We started by talking about the problem and how some of the ideas he was currently learning could help solve it:
At the end of the last video we’d found a nice equation that we derived from the original problem:
Now we used the double angle formula to simplify even more and find a cubic equation satisfied by Cos(36):
Now we tried to find the solutions to the cubic equation we found in the last video. This part gave my son a bit of trouble, but he eventually got there.
Now we were almost home! We just had to compute the value of Cos(72) and we’d be able to solve the problem. That involved one last application of the double angle formula:
I think solving this problem from scratch would be far too difficult for just about any kid just learning trig. But, the fun thing about this problem is that the ideas needed to solve the problem are all within reach using elementary trig identities. So, I think that working through the solution to this problem is a nice exercise for kids.