Maths Olympiad Prep

Library / /59 of 68

, 2017

Combinatorics Difficulty 6.6 National Olympiad Prove it United States

Problem:

Sam spends his days walking around the following 2×22 \times 2 grid of squares.

12
43

Say that two squares are adjacent if they share a side. He starts at the square labeled 11 and every second walks to an adjacent square. How many paths can Sam take so that the sum of the numbers on every square he visits in his path is equal to 2020 (not counting the square he started on)?

Solution

Solution:

Answer: 167167

Note that on the first step, Sam can either step on 22 or 44. On the second step, Sam can either step on 11 or 33, regardless of whether he is on 22 or 44. Now, for example, say that Sam takes 88 steps. His total sum will be 2+1+2+1+2+1+2+1+2a2+1+2+1+2+1+2+1+2a, where aa is the number of times that he decides to step on the larger number of his two choices. Solving gives a=4a=4. As he took 88 steps, this gives him (84)=70\binom{8}{4}=70 ways in this case.

We can follow a similar approach by doing casework on the number of steps he takes. I will simply list them out here for brevity. For 88 steps, we get (84)=70\binom{8}{4}=70. For 99 steps, we get (93)=84\binom{9}{3}=84. For 1212 steps, we get a contribution of (121)=12\binom{12}{1}=12. For 1313 steps, we get a contribution of (130)=1\binom{13}{0}=1. Therefore, the final answer is 70+84+12+1=16770+84+12+1=167.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.