The 2 1 st 21^{\text{st}} Change

Calculus Level 5

Let N ( k ) N(k) be equal to the 2 1 st 21^{\text{st}} derivative of k 3 sin k 2 k^3 \sin k^2 . Determine the sum of the digits of N ( 0 ) N(0) .


The answer is 54.

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.

1 solution

Jeffrey Robles
Dec 18, 2013

One way of solving this is to derive the expression k 3 sin k 2 21 k^3 \sin k^2 \,21 times and then evaluate at k = 0 k=0 . That method kinda consumes quite some time though.

Another way, and I guess more efficient way of answering this is by using the concept of infinite series, Maclaurin Series in particular.

Maclaurin Series is a special type of Taylor Series centered at a = 0 a=0 : f ( x ) = n = 0 f n ( 0 ) n ! x n \\ \quad \qquad \qquad \qquad \qquad \qquad f(x)=\displaystyle \sum_{n=0}^\infty \frac{f^n(0)}{n!}x^n

The first step then is to write the function we are about to analyze as an infinite series. A list of common Maclaurin series can be found in this list of mathworld.wolfram.com. We see that: sin k = n = 0 ( 1 ) n ( 2 n + 1 ) ! k 2 n + 1 \\ \quad \qquad \qquad \qquad \qquad \qquad \sin k=\displaystyle \sum_{n=0}^\infty \frac{(-1)^n}{(2n+1)!}k^{2n+1}

where the expression ( 1 ) n (-1)^n corresponds to the ( 2 n + 1 ) t h (2n+1)^{th} derivative of sin k \sin k at k = 0 k=0 . Using this known relation, we can then rewrite k 3 sin k 2 k^3 \sin k^2 as an infinite series: k 3 sin k 2 = k 3 n = 0 ( 1 ) n ( 2 n + 1 ) ! ( k 2 ) 2 n + 1 \\ \quad \qquad \qquad \qquad \qquad \qquad k^3 \sin k^2=k^3 \displaystyle \sum_{n=0}^\infty \frac{(-1)^n}{(2n+1)!}(k^2)^{2n+1} k 3 sin k 2 = n = 0 ( 1 ) n ( 2 n + 1 ) ! k 4 n + 5 \\ \quad \qquad \qquad \qquad \qquad \qquad k^3 \sin k^2=\displaystyle \sum_{n=0}^\infty \frac{(-1)^n}{(2n+1)!}k^{4n+5}

We then rewrite the above series so similar to that of the expression for a Maclaurin series f ( x ) f(x) . k 3 sin k 2 = n = 0 ( 1 ) n ( 4 n + 5 ) ! ( 2 n + 1 ) ! ( 4 n + 5 ) ! k 4 n + 5 \\ \quad \qquad \qquad \qquad \qquad \qquad k^3 \sin k^2=\displaystyle \sum_{n=0}^\infty \frac{\frac{(-1)^n(4n+5)!}{(2n+1)!}}{(4n+5)!}k^{4n+5}

where ( 1 ) n ( 4 n + 5 ) ! ( 2 n + 1 ) ! \frac{(-1)^n(4n+5)!}{(2n+1)!} is the ( 4 n + 5 ) t h (4n+5)th derivative of the expression evaluated at k = 0 k=0 and hence N ( 0 ) = g ( n ) = ( 1 ) n ( 4 n + 5 ) ! ( 2 n + 1 ) ! N(0)=g(n)=\frac{(-1)^n(4n+5)!}{(2n+1)!} . Since we want to determine the 2 1 s t 21^{st} derivative of the expression, we let 4 n + 5 = 21 4n+5=21 and see that n = 4 n=4 . Therefore, N ( 0 ) = g ( 4 ) = 21 ! 9 = 140792940288000 N(0)=g(4)=\frac{21!}{9}=140792940288000 and the sum of its digits is 54 54 .

There's a bit typo error, the last expression g ( 4 ) g(4) is supposedly 21 ! 9 ! \frac{21!}{9!} . I missed the factorial sign. :)

Jeffrey Robles - 7 years, 5 months ago

Is there a way by which we can calculate the digit sum without actually having to evaluate the sum?

Sambit Senapati - 7 years, 5 months ago

Log in to reply

def digit_sum(n):

x = str(n)

dsum = 0

for i in range(len(x)):

    dsum += int(x[i])

return dsum

import math

a = math.factorial(21)/math.factorial(9)

print digit_sum(a)

Kartik Sharma - 6 years, 3 months ago

I did it in the same way but calculated the sum of digits as 55....my mistake

Shikhar Jaiswal - 7 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...