Maths Olympiad Prep

Track / Stage 6 / 248 of 400 #1728 of 2444

Problem 1728

National Olympiad, first round
Combinatorics Difficulty 6.6 Prove it China Hong Kong Mathematical Olympiad · Hong Kong

Let ABCDEFABCDEF be a regular hexagon of side length 11, and OO be the centre of the hexagon. In addition to the sides of the hexagon, line segments are drawn from OO to each vertex, making a total of twelve unit line segments. Find the number of paths of length 20032003 along these line segments that start at OO and terminate at OO.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

The answer is 7714(1+7)2003+7+714(17)2003\frac{7 - \sqrt{7}}{14}(1 + \sqrt{7})^{2003} + \frac{7 + \sqrt{7}}{14}(1 - \sqrt{7})^{2003}.

For each integer n0n \ge 0, let ana_n be the number of paths of length nn starting at OO and terminating at OO. Also, let bnb_n be the number of paths of length nn starting at OO and terminating at AA. By symmetry, bnb_n is also the number of those paths terminating at any of B,C,D,E,FB, C, D, E, F.

To count ana_n for n1n \ge 1, the (n1)(n-1)st\text{st} step must terminate at one of A,B,C,D,E,FA, B, C, D, E, F. For each of these 66 points, there are bn1b_{n-1} paths terminating at that point. This gives a total of 6bn16b_{n-1} paths. In other words, we have
an=6bn1.(1) a_n = 6b_{n-1}. \tag{1}
To count bnb_n for n1n \ge 1, suppose the nnth\text{th} step terminates at AA. Then the (n1)(n-1)st\text{st} step may terminate at B,FB, F or OO. If it is BB or FF, then there are bn1b_{n-1} paths. If it is OO, then there are an1a_{n-1} paths. Therefore, we have
bn=2bn1+an1.(2) b_n = 2b_{n-1} + a_{n-1}. \tag{2}
Combining (1) and (2), we obtain
16an+1=bn=2bn1+an1=13an+an1. \frac{1}{6}a_{n+1} = b_n = 2b_{n-1} + a_{n-1} = \frac{1}{3}a_n + a_{n-1}.
This can be rewritten as an=2an1+6an2a_n = 2a_{n-1} + 6a_{n-2} for n2n \ge 2. The roots of the characteristic equation λ22λ6=0\lambda^2 - 2\lambda - 6 = 0 are 1±71 \pm \sqrt{7}. Suppose an=A(1+7)n+B(17)na_n = A(1 + \sqrt{7})^n + B(1 - \sqrt{7})^n. Using the initial conditions a0=1a_0 = 1 and a1=0a_1 = 0, we solve
{A+B=1,A(1+7)+B(17)=0. \begin{cases} A + B = 1, \\ A(1 + \sqrt{7}) + B(1 - \sqrt{7}) = 0. \end{cases}
This yields A=7714A = \frac{7 - \sqrt{7}}{14} and B=7+714B = \frac{7 + \sqrt{7}}{14}. Therefore, the answer is
a2003=7714(1+7)2003+7+714(17)2003. a_{2003} = \frac{7 - \sqrt{7}}{14}(1 + \sqrt{7})^{2003} + \frac{7 + \sqrt{7}}{14}(1 - \sqrt{7})^{2003}.

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