Maths Olympiad Prep

Library / /689 of 740

, 2018

Algebra Difficulty 5.7 AIME, harder Prove it United States

Problem:

Pascal has a triangle. In the nnth row, there are n+1n+1 numbers an,0,an,1,an,2,,an,na_{n, 0}, a_{n, 1}, a_{n, 2}, \ldots, a_{n, n} where an,0=an,n=1a_{n, 0}=a_{n, n}=1. For all 1kn11 \leq k \leq n-1, an,k=an1,kan1,k1a_{n, k}=a_{n-1, k}-a_{n-1, k-1}. What is the sum of the absolute values of all numbers in the 2018th row?
Proposed by: Michael Ren

Solution

Solution:

Let sns_{n} be the sum of the absolute values of numbers in the nnth row. For odd nn, we have that an,1,,an,n1a_{n, 1}, \ldots, a_{n, n-1} alternate in sign as ,+,,+,,+-,+,-,+, \ldots,+, with the last term being an,n1=1a_{n, n-1}=1. For even nn, we have that an,1,,an,n2a_{n, 1}, \ldots, a_{n, n-2} alternate in sign as ,+,,+,,+-,+,-,+, \ldots,+, and an,n1=0a_{n, n-1}=0. These facts can be proven by induction. Thus, sn=1an,1+an,2+(1)n1an,n1+1s_{n}=1-a_{n, 1}+a_{n, 2}-\cdots+(-1)^{n-1} a_{n, n-1}+1.

Applying the recursion, for n>0n>0 this becomes
sn=1(an1,1an1,0)+(an1,2an1,1)+(1)n1(an1,n1an1,n2)+1 s_{n}=1-\left(a_{n-1,1}-a_{n-1,0}\right)+\left(a_{n-1,2}-a_{n-1,1}\right)-\cdots+(-1)^{n-1}\left(a_{n-1, n-1}-a_{n-1, n-2}\right)+1
=2(1an1,1+an1,2+(1)n2an1,n2+1)1+(1)n1 =2\left(1-a_{n-1,1}+a_{n-1,2}-\cdots+(-1)^{n-2} a_{n-1, n-2}+1\right)-1+(-1)^{n-1}
In other words, if nn is even then sn=2sn12s_{n}=2 s_{n-1}-2 and if nn is odd then sn=2sn1s_{n}=2 s_{n-1}. This means that s2n=4s2n22s_{2 n}=4 s_{2 n-2}-2. Since 2018 is even, we can write s2018=4s20162=2201822017220152s_{2018}=4 s_{2016}-2=2^{2018}-2^{2017}-2^{2015}-\cdots-2.

Applying the formula for the sum of a geometric series, we get
s2018=2201822019241=22018+23 s_{2018}=2^{2018}-\frac{2^{2019}-2}{4-1}=\frac{2^{2018}+2}{3}

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.