h^(n)= ∑ (k=0 to n) n!/k!(n-k)!f^(n-k) * g^(k)(x) : Prove that the following is true

**simkate96** · September 15th 2010, 09:28 PM

Prove that the following is true for all n ∈ N(natural numbers)
h^(n)= ∑ (k=0 to n) n!/k!(n-k)!f^(n-k) * g^(k)(x)

Note: We can assume Pascal’s Idenity for 1<(or=)k<(or=)m

**Prove It** · September 15th 2010, 10:54 PM

What are $f(x)$ and $g(x)$ ?

Also this is near impossible to read.

Are you asking to show this?

$\displaystyle{h^n(x) = \sum_{k = 0}^n\frac{n!}{k!(n-k)!}f^{n-k}g^k(x)}$

**tonio** · September 16th 2010, 05:34 AM

Originally Posted by simkate96

Prove that the following is true for all n ∈ N(natural numbers)
h^(n)= ∑ (k=0 to n) n!/k!(n-k)!f^(n-k) * g^(k)(x)

Note: We can assume Pascal’s Idenity for 1<(or=)k<(or=)m

This is a very sloppy question: what are $h,\,f,\,g?$ .

I think you're asking to prove Leibnitz equality for the n-th derivative of the product of two derivable functions, and then induction is your friend.

Tonio

Thread: h^(n)= ∑ (k=0 to n) n!/k!(n-k)!f^(n-k) * g^(k)(x) : Prove that the following is true

LinkBack

Thread Tools

Display

h^(n)= ∑ (k=0 to n) n!/k!(n-k)!f^(n-k) * g^(k)(x) : Prove that the following is true

Similar Math Help Forum Discussions

prove whether the set property is true, false, or sometimes true and sometimes false?

Prove whether the set property is always true, always false, or sometimes true or fal

True or False. Prove if true show counter example if false.

E(∑ |X_k|) < ∞ ? How can we prove it?

Help prove the following is true.

Search Tags