If f ( x ) = ( x + 1 ) ( x + 2 ) ( x + 3 ) … ( x + n ) then what is f ′ ( 0 ) ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
There's an easier way to solve this. Hint: Logarithm.
I solved it using logarithm. A simple problem
I only focus the coeficient x since the derivative of x towards d x is absolutely 1
@Chew-Seong Cheong , there's a typo in your solution (the expression for f ′ ( x ) in first approach). You missed the x 's in the denominator. It should be,
f ′ ( x ) = f ( x ) ( x + 1 1 + x + 2 1 + … + x + n 1 ) = f ( x ) ( k = 1 ∑ n x + k 1 )
Log in to reply
Prasun, thanks a lot.
L n ( f ( x ) ) = k = 1 ∑ n ( x + k ) ⇒ f ( x ) f ′ ( x ) = k = 1 ∑ n x + k 1 ⇒ f ′ ( x ) = k = 1 ∑ n x + k f ( x ) ∴ f ′ ( 0 ) = n ! ( 1 + 2 1 + 3 1 + ⋯ + n 1 )
I have little familiarity with the logarithm method, but found another relatively simple solution.
Since we seek f ′ ( 0 ) , we know that the only important terms of f ( x ) are those that are part of the coefficient of x , all others disappear or evaluate to 0 .
So if we imagine that the entire sequence is multiplied out into individual terms, the important ones are ( x ⋅ 2 ⋅ 3 ⋅ 4 ⋅ . . . ⋅ n ) , ( 1 ⋅ x ⋅ 3 ⋅ 4 ⋅ . . . ⋅ n ) , ( 1 ⋅ 2 ⋅ x ⋅ 4 ⋅ . . . ⋅ n ) , ... all the way up to ( 1 ⋅ 2 ⋅ . . . ⋅ ( n − 1 ) ⋅ x ) .
The i th important term in the sequence equals n ! / i ⋅ x .
When we take the derivative, the coefficients remain, and they add up to
n ! / 1 + n ! / 2 + n ! / 3 + n ! / 4 + . . . n ! / n = n ! ( 1 + 1 / 2 + 1 / 3 + . . . + 1 / n ) .
QED .
Note: Slightly more generally, to find f ′ ( k ) (where f is still the function above), we could probably use a transformation on f , such as f ( x ) = g ( x − k ) , allowing us to solve the problem in terms of g ′ ( 0 ) . I haven't tried to see if this works (it's getting a little late in my time zone), so it is purely speculation.
Problem Loading...
Note Loading...
Set Loading...
f ( x ) = ( x + 1 ) ( x + 2 ) ( x + 3 ) . . . ( x + n ) ⇒ f ′ ( x ) ⇒ f ′ ( 0 ) = [ ( x + 2 ) ( x + 3 ) ( x + 4 ) . . . ( x + n ) ] + [ ( x + 1 ) ( x + 3 ) ( x + 4 ) . . . ( x + n ) ] + [ ( x + 1 ) ( x + 2 ) ( x + 4 ) . . . ( x + n ) ] + . . . . . . + [ ( x + 1 ) ( x + 2 ) ( x + 3 ) . . . ( x + n − 1 ) ] = ( x + 1 ) f ( x ) + ( x + 2 ) f ( x ) + ( x + 3 ) f ( x ) + . . . + ( x + n ) f ( x ) = f ( x ) ( x + 1 1 + x + 2 1 + x + 3 1 + . . . + x + n 1 ) = f ( 0 ) ( 1 1 + 2 1 + 3 1 + . . . + n 1 ) = n ! ( 1 + 2 1 + 3 1 + . . . + n 1 )
Okay, let us try on the logarithm method.
f ( x ) = k = 1 ∏ n ( x + k )
⇒ ln ( f ( x ) ) f ( x ) f ′ ( x ) ⇒ f ′ ( x ) ⇒ f ′ ( 0 ) = k = 1 ∑ n ln ( x + k ) = k = 1 ∑ n x + k 1 = f ( x ) k = 1 ∑ n x + k 1 = f ( 0 ) k = 1 ∑ n k 1 = n ! ( 1 + 2 1 + 3 1 + . . . + n 1 )