Olympiad Maths Prep

Track / Stage 6 / 98 of 400 #1098 of 2000

Problem 1098

National olympiad, first round
Combinatorics Difficulty 6.1 Prove it

Example 8 Let ana_{n} be the number of natural numbers NN such that the sum of the digits of NN is nn and each digit can only be 1, 3, or 4. Prove that a2na_{2 n} is a perfect square.
(1991 National High School League Question, see Example 5 in Chapter 10)

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Let N=x1x2xkN=\overline{x_{1} x_{2} \cdots x_{k}}, where x1,x2,,xk{1,3,4}x_{1}, x_{2}, \cdots, x_{k} \in\{1,3,4\}, and x1+x2++xk=nx_{1}+x_{2}+\cdots+x_{k}=n. Assuming n>4n>4, when x1x_{1} is removed, then when x1x_{1} takes 1,3,41,3,4 respectively, x2+x3++xkx_{2}+x_{3}+\cdots+x_{k} equals n1,n3,n4n-1, n-3, n-4, hence when n>4n>4, an=an1+an3+an4a_{n}=a_{n-1}+a_{n-3}+a_{n-4}, and it is easy to see that a1=1,a2=1,a3=2,a4=4a_{1}=1, a_{2}=1, a_{3}=2, a_{4}=4.
(1) is a 4th-order difference equation, whose characteristic equation x4x3x1=0x^{4}-x^{3}-x-1=0 has four roots ±i,12(1±5)\pm \mathrm{i}, \frac{1}{2}(1 \pm \sqrt{5}). Therefore, the solution to (1) is an=C1in+C2(i)n+C3(1+52)n+C4(152)na_{n}=C_{1} \mathrm{i}^{n}+C_{2}(-\mathrm{i})^{n}+C_{3}\left(\frac{1+\sqrt{5}}{2}\right)^{n}+C_{4}\left(\frac{1-\sqrt{5}}{2}\right)^{n}, using the initial values (2) we get an=2i10in+2+i10(i)n+15(1+52)n+2+15(152)n+2a_{n}=\frac{2-\mathrm{i}}{10} \cdot \mathrm{i}^{n}+\frac{2+\mathrm{i}}{10}(-\mathrm{i})^{n}+\frac{1}{5}\left(\frac{1+\sqrt{5}}{2}\right)^{n+2}+\frac{1}{5}\left(\frac{1-\sqrt{5}}{2}\right)^{n+2}, thus
{a2k=15[(1+52)k+1(152)k+1]2;a2k+1=15[(1)k+(1+52)2k+3+(152)2k+3]. \left\{\begin{array}{l} a_{2 k}=\frac{1}{5}\left[\left(\frac{1+\sqrt{5}}{2}\right)^{k+1}-\left(\frac{1-\sqrt{5}}{2}\right)^{k+1}\right]^{2} ; \\ a_{2 k+1}=\frac{1}{5}\left[(-1)^{k}+\left(\frac{1+\sqrt{5}}{2}\right)^{2 k+3}+\left(\frac{1-\sqrt{5}}{2}\right)^{2 k+3}\right] . \end{array}\right.

It is not difficult to verify that a2ka2k+2=a2k+12\quad a_{2 k} \cdot a_{2 k+2}=a_{2 k+1}^{2}.
Finally, we prove the conclusion of this problem by mathematical induction. Clearly, the conclusion is correct when n=1n=1. Suppose a2na_{2 n} is a perfect square, then by (3) we know a2n+2a_{2 n+2} is a perfect square, therefore the conclusion holds for any natural number nn.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.