Question and Answers Forum

All Questions      Topic List

Relation and Functions Questions

Previous in All Question      Next in All Question      

Previous in Relation and Functions      Next in Relation and Functions      

Question Number 33072 by prof Abdo imad last updated on 10/Apr/18

find  Σ_(k=0) ^n  k C_n ^k  .

$${find}\:\:\sum_{{k}=\mathrm{0}} ^{{n}} \:{k}\:{C}_{{n}} ^{{k}} \:. \\ $$

Commented by abdo imad last updated on 10/Apr/18

let consider the polynome p(x)= Σ_(k=0) ^n  C_n ^k   x^k   p(x)=(x+1)^n    and  p^′ (x)= n(x+1)^(n−1)   and from  another side p^′ (x)= Σ_(k=1) ^n  k C_n ^k  x^(k−1) ⇒  p^′ (1) = Σ_(k=1) ^n  k C_n ^k    = n 2^(n−1)   .

$${let}\:{consider}\:{the}\:{polynome}\:{p}\left({x}\right)=\:\sum_{{k}=\mathrm{0}} ^{{n}} \:{C}_{{n}} ^{{k}} \:\:{x}^{{k}} \\ $$$${p}\left({x}\right)=\left({x}+\mathrm{1}\right)^{{n}} \:\:\:{and}\:\:{p}^{'} \left({x}\right)=\:{n}\left({x}+\mathrm{1}\right)^{{n}−\mathrm{1}} \:\:{and}\:{from} \\ $$$${another}\:{side}\:{p}^{'} \left({x}\right)=\:\sum_{{k}=\mathrm{1}} ^{{n}} \:{k}\:{C}_{{n}} ^{{k}} \:{x}^{{k}−\mathrm{1}} \Rightarrow \\ $$$${p}^{'} \left(\mathrm{1}\right)\:=\:\sum_{{k}=\mathrm{1}} ^{{n}} \:{k}\:{C}_{{n}} ^{{k}} \:\:\:=\:{n}\:\mathrm{2}^{{n}−\mathrm{1}} \:\:. \\ $$

Answered by sma3l2996 last updated on 10/Apr/18

k^n C_k =((n!)/((k−1)(n−k)!))=((n(n−1)!)/((k−1)!(n−1−(k−1))!))=n^(n−1) C_(k−1)   So  Σ_(k=0) ^n k^n C_k =nΣ_(k=1) ^n ^(n−1) C_(k−1)   We have  Σ_(k=0) ^n ^n C_k =2^n   let l=k−1  So Σ_(k=1) ^n ^(n−1) C_(k−1) =Σ_(l=0) ^(n−1) ^(n−1) C_l =2^(n−1)    Σ_(k=0) ^n k^n C_k =2^(n−1) n

$${k}\:^{{n}} {C}_{{k}} =\frac{{n}!}{\left({k}−\mathrm{1}\right)\left({n}−{k}\right)!}=\frac{{n}\left({n}−\mathrm{1}\right)!}{\left({k}−\mathrm{1}\right)!\left({n}−\mathrm{1}−\left({k}−\mathrm{1}\right)\right)!}={n}\:^{{n}−\mathrm{1}} {C}_{{k}−\mathrm{1}} \\ $$$${So}\:\:\underset{{k}=\mathrm{0}} {\overset{{n}} {\sum}}{k}\:^{{n}} {C}_{{k}} ={n}\underset{{k}=\mathrm{1}} {\overset{{n}} {\sum}}\:^{{n}−\mathrm{1}} {C}_{{k}−\mathrm{1}} \\ $$$${We}\:{have}\:\:\underset{{k}=\mathrm{0}} {\overset{{n}} {\sum}}\:^{{n}} {C}_{{k}} =\mathrm{2}^{{n}} \\ $$$${let}\:{l}={k}−\mathrm{1} \\ $$$${So}\:\underset{{k}=\mathrm{1}} {\overset{{n}} {\sum}}\:^{{n}−\mathrm{1}} {C}_{{k}−\mathrm{1}} =\underset{{l}=\mathrm{0}} {\overset{{n}−\mathrm{1}} {\sum}}\:^{{n}−\mathrm{1}} {C}_{{l}} =\mathrm{2}^{{n}−\mathrm{1}} \: \\ $$$$\underset{{k}=\mathrm{0}} {\overset{{n}} {\sum}}{k}\:^{{n}} {C}_{{k}} =\mathrm{2}^{{n}−\mathrm{1}} {n}\: \\ $$

Terms of Service

Privacy Policy

Contact: info@tinkutara.com