Thread: Problem 43
View Single Post
  #2  
Old December 4th, 2007, 11:28 PM
DivideBy0's Avatar
DivideBy0 DivideBy0 is offline
Senior Member
 
Join Date: Mar 2007
Location: Melbourne, Australia
Posts: 426
Country:
Thanks: 201
Thanked 96 Times in 90 Posts
DivideBy0 has a spectacular aura aboutDivideBy0 has a spectacular aura about
Default

Quote:
Originally Posted by ThePerfectHacker View Post
2)Let f(x) and g(x) be functions which you can differenciate. Note that [f(x)g(x)]' = f'(x)g(x)+f(x)g'(x). Can you find a formula for [f(x)g(x)]^{(n)} where by ^{(n)} means to preform differenciation n times repeatedly.
After a little experimenting:

[f(x)g(x)]'=f'(x)g(x) + f(x)g'(x)

[f(x)g(x)]''=f''(x)g(x)+2f'(x)g'(x)+f(x)g''(x)

[f(x)g(x)]''' = f'''(x)g(x)+3f''(x)g'(x)+3f'(x)g''(x)+f(x)g'''(x)

This reminds me of the binomial theorem:

(x+y)^n = \sum_{k=0}^n {n \choose k}x^{n-k} y^{k}

So perhaps

[f(x)g(x)]^{(n)} = \sum_{k=0}^n {n\choose k} f^{n-k}(x) g^{k}(x)

Where h^n(x) denotes the nth derivative of h(x)

Nice problem

P.S Is there any way to hide text?
The following users thank DivideBy0 for this useful post:
Donate to MHF