Deduce a formula (in terms of n) for the following sum: sum (2^i * i) where 1<=i<=n, n,i: natural numbers ( one can write this sum as: 1*2^1+ 2*2^2+ .. +n*2^n)

Let S = sum i* 2i (i=1,2..n) We multiply this by 2 and we obtain:2S = sum (i2i+1 ) = sum [(i+1-1) * 2i+1 ]= sum[ (i+1)2i+1 ] - sum 2i+1 i=1,2..n ()
sum (i+1)2i+1 = 222 + .. n
2n + (n+1)* 2n+1 = S + (n+1) * 2n+1 - 1*21 = S + (n+1)2n+1 -2
Note that the second sum is the sum of a geometric series of ratio 2, it is equal to 2n+2 - 4. Here is a quick proof:Let Z = sum 2i+1 = 22 + 23+ .. + 2n+1 . 2Z = sum 2i+2 = 23 + .. + 2n+1 + 2n+2 . So, 2Z-Z = Z = 2n+2 - 22
Going back to (
) we obtain that 2S =S + (n+1) * 2n+1 - 2 - (2n+2 - 4), which implies that S = (n+1) * 2n+1 - 2n+2 + 2


Answered by Alexandru S. MAT tutor

1767 Views

See similar MAT University tutors

Related MAT University answers

All answers ▸

The sequence xn is given by the formula x_n = n^3 − 9n^2 + 631. What is the largest value of n for which x_n > x_(n+1)?


I've been doing specimen MAT admission test - but I couldn't figure out the answer to the parts III, and IV of question 6 (https://www.maths.ox.ac.uk/system/files/attachments/speca.pdf). Is there some kind of a trick?


How many distinct real roots does the equation x^3 − 30x^2 + 108x − 104 = 0 have?


We define the digit sum of a non-negative integer to be the sum of its digits. For example, the digit sum of 123 is 1 + 2 + 3 = 6. Let n be a positive integer with n < 10. How many positive integers less than 1000 have digit sum equal to n?


We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences