Compare two halves of a binomial expansion

Let t t be a positive integer and n = 2 t + 1 n = 2t + 1 . Define A = i = 0 t ( n i ) 201 9 i \displaystyle A = \sum_{i = 0}^{t}{n \choose i} 2019^i and B = i = t + 1 n ( n i ) 201 9 i \displaystyle B = \sum_{i = t+1}^{n} {n \choose i} 2019^i .

Compare 2019 A 2019A and B B .

2019 A = B 2019A = B 2019 A > B 2019A > B 2019 A < B 2019A < B

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

4 solutions

Chew-Seong Cheong
Mar 14, 2019

B = i = t + 1 2 t + 1 ( 2 t + 1 i ) 201 9 i Note that i = t + 1 2 t + 1 ( 2 t + 1 i ) = i = 0 t ( 2 t + 1 i ) = i = 0 t ( 2 t + 1 i ) 201 9 2 t + 1 i = i = 0 t ( 2 t + 1 i ) 201 9 i + ( 2 t 2 i + 1 ) Since 2 t 2 i + 1 1 > 2019 A \begin{aligned} B & ={\color{#3D99F6}\sum_{i=t+1}^{2t+1} \binom {2t+1}i} 2019^i & \small \color{#3D99F6} \text{Note that }\sum_{i=t+1}^{2t+1} \binom {2t+1}i = \sum_{i=0}^t \binom {2t+1}i \\ & = {\color{#3D99F6} \sum_{i=0}^t \binom {2t+1}i} 2019^{2t+1-i} \\ & = {\color{#3D99F6} \sum_{i=0}^t \binom {2t+1}i} 2019^{i + \color{#D61F06}(2t-2i+1)} & \small \color{#D61F06} \text{Since }2t - 2i + 1 \ge 1 \\ & \boxed{> 2019A} \end{aligned}

I think your transition to the sum i = 0 t ( 2 t + 1 i ) 201 9 i + t + 1 \sum_{i=0}^{t}{2t+1 \choose i}2019^{i+t+1} is not entirely correct. What is the coefficient of the term 201 9 2 t + 1 2019^{2t+1} in B B and in i = 0 t ( 2 t + 1 i ) 201 9 i + t + 1 \sum_{i=0}^{t}{2t+1 \choose i}2019^{i+t+1} ?

(Edit: you had the right idea approaching this problem, only got the notation mixed up. Keep going!)

Tùng Nguyễn Minh - 2 years, 2 months ago

Log in to reply

You are right. I will change the solution.

Chew-Seong Cheong - 2 years, 2 months ago

Have a closer look at B B and define a new counting variable: j = n i j = n - i . Then j j is from n ( t + 1 ) = 2 t + 1 ( t + 1 ) = t n - (t+1) = 2t+1 - (t+1) = t to n n = 0 n - n = 0 , while ( n i ) = n ! i ! ( n i ) ! = ( n ( n i ) ) = ( n j ) {n \choose i} = \frac{n!}{i!(n-i)!} = {n \choose (n - i)} = {n \choose j} . So B B can be rearranged and written as: B = j = 0 t ( n j ) 201 9 n j B = \sum_{j = 0}^{t}{n \choose j}2019^{n-j} .

Consider B 2019 A B - 2019A we have: B 2019 A = j = 0 t ( n j ) 201 9 n j 2019 i = 0 t ( n i ) 201 9 i = j = 0 t ( n j ) 201 9 2 t + 1 j j = 0 t ( n j ) 201 9 j + 1 B - 2019A = \sum_{j = 0}^{t}{n \choose j}2019^{n-j} - 2019\sum_{i = 0}^{t}{n \choose i}2019^i\ = \sum_{j = 0}^{t}{n \choose j}2019^{2t+1-j} - \sum_{j = 0}^{t}{n \choose j}2019^{j+1} (rename the variable in the latter sum from i i to j j ) = j = 0 t ( n j ) ( 201 9 2 t j + 1 201 9 j + 1 ) =\sum_{j = 0}^{t}{n \choose j}(2019^{2t-j+1} - 2019^{j+1}) .

For any j j from 0 0 to t 1 t - 1 we see that 201 9 2 t j + 1 201 9 j + 1 > 0 2019^{2t - j +1} - 2019^{j +1} > 0 (note the case j = 0 j = 0 ) while at j = t j = t , 201 9 2 t j + 1 201 9 j + 1 = 201 9 t + 1 201 9 t + 1 = 0 2019^{2t- j +1} - 2019^{j+1} = 2019^{t+1} - 2019^{t+1} = 0 . This ensures ( n j ) ( 201 9 2 t j 201 9 j ) 0 {n \choose j}(2019^{2t - j} - 2019^j) \geq 0 for all j { 0 , 1 , . . . , t } j \in \{0,1,...,t\} . And because the term j = 0 j = 0 is present regardless of t t , B 2019 A = j = 0 t ( n j ) ( 201 9 2 t j + 1 201 9 j + 1 ) > 0 B - 2019A = \sum_{j = 0}^{t}{n \choose j}(2019^{2t - j+1} - 2019^{j+1}) > 0 for all positive integer t t , implying B > 2019 A B > 2019 A .

t = 1 1 t=1\Longrightarrow 1 ; n = 2 t + 1 3 n=2 t+1 \Longrightarrow 3 ; assuming x 1 x\geq 1 , which it is as x = 2019 x=2019 , ( i = 0 t x i + 1 ( n i ) 3 x 2 + x ) < ( i = t + 1 n x i ( n i ) x 3 + 3 x 2 ) (\sum _{i=0}^t x^{i+1} \binom{n}{i} \Longrightarrow 3\ x^2+x)<(\sum _{i=t+1}^n x^i \binom{n}{i} \Longrightarrow x^3+3 x^2) . The difference only becomes greater as t t becomes larger.

Kyle T
Mar 14, 2019

Wolfram, using t=1 meaning n=3
You can see that B is much larger than 2019*A

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...