Saying good bye to 2015!

N = m = 6 2015 k = 6 m k ! ( k 5 ) ! \large N= \sum_{m=6}^{2015}\sum_{k=6}^m \frac{k!}{(k-5)!}

If N N is represented in the decimal form, find the sum of all its digits.


The answer is 60.

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.

3 solutions

Arturo Presa
Dec 5, 2015

Let us represent the expression r ! ( r s ) ! \large\frac{r!}{(r-s)!} by P ( r , s ) , \large P(r,s), where r r and s s are non-negative integer numbers and r s r\geq s . Then it is easy to see that if r > s , r> s, then P ( r , s ) = P ( r + 1 , s + 1 ) P ( r , s + 1 ) s + 1 . ( ) \large P(r,s)=\frac{P(r+1, s+1)-P(r, s+1)}{s+1}.\:\:\:\:\:\:\:\:(*) Using this formula we obtain k = 6 m P ( k , 5 ) = 1 6 k = 6 m ( P ( k + 1 , 6 ) P ( k , 6 ) ) = 1 6 ( P ( m + 1 , 6 ) P ( 6 , 6 ) ) . \large \sum_{k=6}^m P(k, 5)=\frac{1}{6}\sum_{k=6}^m(P(k+1, 6)-P(k,6))=\frac{1}{6}(P(m+1,6)-P(6,6)). Then N = m = 6 2015 1 6 ( P ( m + 1 , 6 ) P ( 6 , 6 ) ) = 1 6 m = 6 2015 P ( m + 1 , 6 ) 1 6 2010 × P ( 6 , 6 ) \large N=\sum_{m=6}^{2015} \frac{1}{6}(P(m+1,6)-P(6,6))=\frac{1}{6}\sum_{m=6}^{2015}P(m+1,6)-\frac{1}{6}2010\times P(6,6)

Applying the formula ( ) (*) again we obtain that

N = 1 6 m = 6 2015 1 7 ( P ( m + 2 , 7 ) P ( m + 1 , 7 ) ) 1 6 2010 × 6 ! = \large N=\frac{1}{6}\sum_{m=6}^{2015}\frac{1}{7}( P(m+2, 7)-P(m+1,7))-\frac{1}{6}2010\times 6!= = 1 42 ( P ( 2017 , 7 ) P ( 7 , 7 ) ) 2010 × 5 ! = 3200114179550023540440. \large =\frac{1}{42}(P(2017, 7)-P(7, 7)) -2010\times 5!=3200114179550023540440. So the answer is : 3 + 2 + 0 + 0 + 1 + 1 + 4 + 1 + 7 + 9 + 5 + 5 + 0 + 0 + 2 + 3 + 5 + 4 + 0 + 4 + 4 + 0 = 60. 3+2+0+0+1+1+4+1+7+9+5+5+0+0+2+3+5+4+0+4+4+0=60.

Can't you provide a relatively smaller answer which could have been fit into a normal mobile calculator...I got the same expression but it showed in terms of exponential form on calculator and hence all the digits were not covered...:-(

Righved K - 5 years, 6 months ago

Log in to reply

I understand you. The problem would be more elegant if one could do the last calculation using a calculator or by hand. Now it is a little difficult to change the answer format.

Arturo Presa - 5 years, 6 months ago

Log in to reply

I got the answer as 120 × ( ( 2017 7 ) 2011 ) 120 \times ( {2017 \choose 7} - 2011) .

And then I googled for a high precision calculator to evaluate that.

A Former Brilliant Member - 5 years, 6 months ago

Log in to reply

@A Former Brilliant Member That is right!

Arturo Presa - 5 years, 6 months ago

@A Former Brilliant Member 2017 ! 7 ! × 2010 ! = 26667618162916864848 \displaystyle \frac{2017!}{7! \times 2010!} = 26667618162916864848 does give 3200114179550023540440. 3200114179550023540440.

Lu Chee Ket - 5 years, 6 months ago

= (2017)(2016)(2015)(2014)(2013)(2012)(2011)/42 - 5! - (2010) 5!

= 3200114179550023781760 - 120 - 241200

= 3200114179550023540440

Lu Chee Ket - 5 years, 6 months ago

The solution to the problem is very nice and intention is good about thinking how to manipulate the tough looking binomial coefficients series . But would have been better if the calculations were doable ! . Nice Problem

Prakhar Bindal - 5 years, 6 months ago

Log in to reply

Thank you for giving your opinion! I am going to take it into consideration for future problems!

Arturo Presa - 5 years, 6 months ago

Plus@@IntegerDigits [ m = 6 2015 k = 6 m k ! ( k 5 ) ! ] \text{Plus}\text{@@}\text{IntegerDigits}\left[\sum _{m=6}^{2015} \sum _{k=6}^m \frac{k!}{(k-5)!}\right]

60 60

Lu Chee Ket
Dec 7, 2015

Little value is found from simple routine with only 18 S.F. calculations:

1
2
3
4
5
6
7
8
     N:=0.0;
     FOR m:=6 TO 2015 DO
      FOR k:=6 TO m DO
          N:=N+Cut(1.0*k*(k-1.0)*(k-2.0)*(k-3.0)*(k-4.0));

     WRITELN('Completed.');
     WRITE(N:1:0);
     READLN

3200114179550023540440

Answer: 60 \boxed{60}

A valuable algorithm is found for solving this question.

Lu Chee Ket - 5 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...