The equation above holds true for constants . Find the sum of digits of the number .
Notation
:
denotes the
factorial
notation. For example,
.
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.
By analyzing the fractions made from A = x ( x + 1 ) ( x + 2 ) . . . ( x + k ) 1 we see that for k = 2 , A = 1 ∗ 2 ∗ x 1 + − 1 ∗ 1 ∗ ( x + 1 ) 1 + − 2 ∗ − 1 ∗ ( x + 2 ) 1
Continuing for larger values of k, using the cover-up method for partial fractions, we can develop the following summation to generalize for any integer k > 0 ,
A = x ( x + 1 ) ( x + 2 ) . . . ( x + k ) 1 = ∑ i = 0 k ( x + i ) ( i ! ) ( k − i ) ! ( − 1 ) i
All we need is the 2 5 t h fraction corresponding to i = 2 4 . ( x + 2 4 ) ( 2 4 ! ) ( 2 5 − 2 4 ) ! 2 5 ! ∗ ( − 1 ) 2 4 which reduces to x + 2 4 2 5