2010-11-23 47 views
0

考虑,如何计算下面的公式

1*2^1 + 2*2^2 + 3*2^3 + 4*2^4 + ... d * 2^d 

= sum(r * 2^r, r from 1 to d) 

我们如何可以推断以下解决方案?

= 2 (d-1) * 2^d + 2 

谢谢

+5

试着问这里:http://math.stackexchange.com/ – Zeke 2010-11-23 05:49:08

+0

你问一个证明,解决方案是正确的还是通用的方式如何将一系列转换为封闭的形式? – martineno 2010-11-23 05:50:39

回答

2

通过inductiond

基本情况

d = 1 
sum(r * 2^r, r from 1 to 1) = 1 * 2^1 = 1 * 2 = 2 
2 * (1 - 1) * 2^1 + 2 = 2 * 0 * 2 + 2 = 0 + 2 = 2 

感应案例

我们假定归纳假设是正确的d这样的:

sum(r * 2^r, r from 1 to d + 1) = 
sum(r * 2^r, r from 1 to d) + [(d + 1) * 2^(d + 1)] = 
2 * (d-1) * 2^d + 2 + [(d + 1) * 2^(d + 1)] = 
(d - 1) * 2^(d + 1) + 2 + d * 2^(d + 1) + 2^(d + 1) = 
d * 2^(d + 1) - 2^(d + 1) + 2 + d * 2^(d + 1) + 2^(d + 1) = 
d * 2^(d + 1) + 2 + d * 2^(d + 1) = 
2 * d * 2^(d + 1) + 2 (result 1) 

现在评估公式为d + 1

2 (d-1) * 2^d + 2 = (substituting d + 1 for d) 
2 * (d + 1 - 1) * 2^(d + 1) + 2 = 
2 * d * 2^(d + 1) + 2 (result 2) 

从而

2 * d * 2^(d + 1) + 2 (result 1) = 2 * d * 2^(d + 1) + 2 (result 2) 

QED