Question #69617

Prove that $\sum_{i=1}^s a_i=2^{n}-1-\sum_{i=s+1}^n a_i=2^s-1. Note that $\sum_{i=1}^n=2^n-1.
1

Expert's answer

2017-08-08T14:17:06-0400

Answer on Question #69617 - Math - Combinatorics / Number Theory

Question

Prove that i=1s2i=2(2n1)i=s+1n2i=2(2s1)\sum_{i=1}^{s} 2^i = 2(2^n - 1) - \sum_{i=s+1}^{n} 2^i = 2(2^s - 1)

Note that i=0n2i=2n+11\sum_{i=0}^{n} 2^i = 2^{n+1} - 1

Solution

We shall prove


i=0n2i=2n+11\sum_{i=0}^{n} 2^i = 2^{n+1} - 1


by induction.

Base case: setting n=0n = 0, we get


i=002i=20=1=20+11\sum_{i=0}^{0} 2^i = 2^0 = 1 = 2^{0+1} - 1


True

Induction step: Let nn be an arbitrary natural number and suppose that


20+21++2n=2n+112^0 + 2^1 + \cdots + 2^n = 2^{n+1} - 1


Then


20+21++2nFormula (1)+2n+1=2n+11Formula (1)+2n+1=22n+11=2n+21,\underbrace{2^0 + 2^1 + \cdots + 2^n}_{\text{Formula (1)}} + 2^{n+1} = \underbrace{2^{n+1} - 1}_{\text{Formula (1)}} + 2^{n+1} = 2 \cdot 2^{n+1} - 1 = 2^{n+2} - 1,


hence


i=0n+12i=2n+21\sum_{i=0}^{n+1} 2^i = 2^{n+2} - 1


holds true.

By the principle of mathematical induction, we proved that


i=0n2i=2n+11\sum_{i=0}^{n} 2^i = 2^{n+1} - 1


Therefore


i=1n2i=i=0n2i20=2n+111=2n+12=2(2n1)\sum_{i=1}^{n} 2^i = \sum_{i=0}^{n} 2^i - 2^0 = 2^{n+1} - 1 - 1 = 2^{n+1} - 2 = 2(2^n - 1)


and


i=1s2i=2s+12=2(2s1)\sum_{i=1}^{s} 2^i = 2^{s+1} - 2 = 2(2^s - 1)


Next,


i=0n2i=20+i=1n2i=1+i=1s2i+i=s+1n2i=2n+11,\sum_{i=0}^{n} 2^i = 2^0 + \sum_{i=1}^{n} 2^i = 1 + \sum_{i=1}^{s} 2^i + \sum_{i=s+1}^{n} 2^i = 2^{n+1} - 1,


hence


i=1s2i=2n+111i=s+1n2i=2(2n1)i=s+1n2i\sum_{i=1}^{s} 2^i = 2^{n+1} - 1 - 1 - \sum_{i=s+1}^{n} 2^i = 2(2^n - 1) - \sum_{i=s+1}^{n} 2^i


There are two ways to express i=1s2i\sum_{i=1}^{s} 2^i if we use formulas (2) and (3):


i=1s2i=2(2n1)i=s+1n2i=2(2s1)\sum_{i=1}^{s} 2^i = 2(2^n - 1) - \sum_{i=s+1}^{n} 2^i = 2(2^s - 1)


Q.E.D.

Answer provided by https://www.AssignmentExpert.com

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS