Let P ( n ) = m = 1 ∑ ∞ ( k = 0 ∏ n m + k 1 ) And Q ( n ) = k = 1 ∑ n P ( k ) 1
Then find the last 4 digits of Q ( 2 0 1 5 ) + 2 0 1 5
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.
I used Jon Haussman method to solve , enjoyed this question , we are able to see this-
P ( n ) = m = 1 ∑ ∞ ( k = 0 ∏ n m + k 1 )
P ( n ) = m = 1 ∑ ∞ m × ( m + 1 ) × ( m + 2 ) ⋯ ( m + n ) 1
P ( n ) = m = 1 ∑ ∞ ( m + n ) ! ( m − 1 ) !
P ( n ) = n . n ! 1 m = 1 ∑ ∞ ( m + n ) ! ( m − 1 ) ! n ! ( m + n − m )
P ( n ) = n . n ! 1 m = 1 ∑ ∞ ( m + n − 1 ) ! ( m − 1 ) ! n ! − ( m + n ) ! m ! n !
P ( n ) = n . n ! 1
[Q(n) = n.n!]
Q ( n ) = ( n + 1 − 1 ) n ! ⟹ ( n + 1 ) ! − n !
Q ( 2 0 1 5 ) + 2 0 1 5 = 2 0 1 6 ! − 1 + 2 0 1 5 = 2 0 1 6 ! + 2 0 1 4
I think it was not necessary to take mod , we can directly say 2016! will have many zeros so the last four digits of it will be 0000 and adding 2014 we get the last four digits as 2014.
Log in to reply
No, by taking ( m o d 1 0 0 0 0 ) , I mean exactly the same i.e. the last four digits. It doesn't makes any difference.
FYI, I've made it such that the skill on this problem links to the corresponding wiki page. You can see this in the top right corner.
If you add problems from a wiki page, then they will be attached directly.
Log in to reply
Oh! Thank You So Much....
Can you tell me how can I link my previous problem also?
The above series simplifies to
1 . 2 . 3 . . . . . ( n + 1 ) 1 + 2 . 3 . 4 . 5 . . . . . . . ( n + 2 ) 1 . . . . .
multiply and divide by n.
n 1 ( 1 . 2 . 3 . . . . ( n + 1 ) n + 1 − 1 + 2 . 3 . 4 . . . . . . ( n + 2 ) n + 2 − 2 . . . )
this is a telescopic series and thus we get
[ P ( n ) = n . n ! 1 ]
After that the next part is easy.
This was why I noticed 36288000 during solving task.
P ( n ) = m = 1 ∑ ∞ ( k = 0 ∏ n m + k 1 )
= m = 1 ∑ ∞ n 1 ( k = 0 ∏ n − 1 m + k 1 − k = 1 ∏ n m + k 1 )
= n 1 k = 0 ∏ n − 1 1 + k 1
= n ⋅ n ! 1
Q ( n ) = k = 1 ∑ n k ⋅ k !
= k = 1 ∑ n ( ( k + 1 ) ! − k ! )
= ( n + 1 ) ! − 1
Q ( 2 0 1 5 ) + 2 0 1 5 = 2 0 1 6 ! + 2 0 1 4
Since 2 0 1 6 ! has more than four trailing zeroes, the answer is 2 0 1 4 .
1/ P (n) = {1, 4, 18, 96, 600, 4320, 35280, ... , 2311256907767808000, 48658040163532800000, 1072909785605898240000, ...} Sequence can be formulated for finding all terms;
r = n + 1/ n + 2; 1/ P (n) = (n)(n!)
Q (n) = {1, 5, 23, 119, 719, 5039, 40319, ..., 121645100408831999, ...}
[Q (2015)] = [Q (21)] = 9999
9999 + 2015 = 12014
[12014] = 2014
why do u always give this sort of a solution better of nothing......(sorry)
Problem Loading...
Note Loading...
Set Loading...
We observe Kishlaya's Identity closely and make use of the MacLaurin Expansion of lo g ( 1 − x ) n = 1 ∑ ∞ m = 1 ∑ ∞ m ( m n + m ) x n = − lo g ( 1 − x ) ⇒ n = 1 ∑ ∞ x n ( m = 1 ∑ ∞ m ( m n + m ) 1 ) = k = 1 ∑ ∞ k x k On comparing the coefficients, we can conclude the following m = 1 ∑ ∞ m ( m n + m ) 1 = n 1 ⇒ m = 1 ∑ ∞ ( n + m ) ! ( m − 1 ) ! = n . n ! 1 ⇒ m = 1 ∑ ∞ ( k = 0 ∏ n m + k 1 ) = n . n ! 1 And thus, P ( n ) = n . n ! 1
(I'll leave it as an exercise for the reader to compute P ( n ) by other method(s).)
Now, we compute Q ( n ) as Q ( n ) = k = 1 ∑ n P ( k ) 1 = k = 1 ∑ n k . k ! We can telescope the above sum as ⇒ k . k ! = ( ( k + 1 ) − 1 ) . k ! = ( k + 1 ) ! − k ! ⇒ Q ( n ) = k = 1 ∑ n P ( k ) 1 = k = 1 ∑ n ( k + 1 ) ! − k ! = 2 ! − 1 ! + 3 ! − 2 ! + … + ( n + 1 ) ! − n ! And thus, ⇒ Q ( n ) = ( n + 1 ) ! − 1 Therefore, we are just left with computing Q ( 2 0 1 5 ) + 2 0 1 5 ( m o d 1 0 0 0 0 ) = 2 0 1 6 ! + 2 0 1 4 ( m o d 1 0 0 0 0 ) = 2 0 1 4