What are the last 3 digits of ∑ k = 1 1 0 ( 3 k 3 0 ) ?
This problem is posed by Eric E .
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.
Great solution! Thanks!
Great solution.
'Brilliant' solution.Exactly how I thought!
Akshit Kumar, Soham Dibyachintan, Ajay Maity - Thanks
Can't we use Hockey-Stick Formula?
Log in to reply
what's that sir ?
Log in to reply
This link explains it better than I could.
http://euclid.ucc.ie/pages/MATHENR/Exercises/CombinatoricsInductionSums.pdf Page 12
brilliant
nice job, nobody's gonna calculate that all the way down the wire. I used the same trick !!!!!
wow! Got to know a fantastic property
brlliant.... salute boss
Plug this into Python:
def fact(n):
a=1
b=0
for i in range(n):
a=a*(b+1)
b=b+1
return a
def choose(m):
return (fact(30)/(fact(m)*fact(30-m)))
s=0
for i in range(3, 31, 3):
s=s+choose(i)
print(s)
This is a mathematics question and not computer science.
:P trolled
Problem Loading...
Note Loading...
Set Loading...
Instead of finding out the value of ∑ k = 1 1 0 ( 3 k 3 0 ) , we'll derive a general expression which can be easily done using the roots of unity.
By Binomial Theorem, we already have ( 1 + x ) n = ( 0 n ) + ( 1 n ) x + ( 2 n ) x 2 + … + ( n n ) x n
Now, first we see that the in the expression ∑ k = 1 1 0 ( 3 k 3 0 ) = ( 3 3 0 ) + ( 6 3 0 ) + … we have the r (of ( r n ) ) at gaps of 3 . That suggests us to use the cube root of unity ω .
We'll use the property that 1 + ω + ω 2 = 0 and ω 3 = 1
So now we plug 1 , ω and ω 2 in ( 1 + x ) n successively to get -
( 1 + 1 ) n = 2 n = ( 0 n ) + ( 1 n ) + ( 2 n ) + … + ( n n )
( 1 + ω ) n = ( − ω 2 ) n = ( 0 n ) + ( 1 n ) ω + ( 2 n ) ω 2 + … + ( n n ) ω n
( 1 + ω 2 ) n = ( − ω ) n = ( 0 n ) + ( 1 n ) ω 2 + ( 2 n ) ω 4 + … + ( n n ) ω 2 n
Now, add these tree expressions to get the desired result -
( 2 n + ( − ω ) n + ( − ω 2 ) n ) = 3 ( ( 0 n ) + ( 1 n ) ( 1 + ω + ω 2 ) + ( 2 n ) ( 1 + ω + ω 2 ) + … + ( n n ) ( 1 + ω + ω 2 ) )
= 3 ( ( 0 n ) + ( 3 n ) + ( 6 n ) + … )
Hence,
( 3 n ) + ( 6 n ) + … = 3 ( 2 n + ( − ω ) n + ( − ω 2 ) n ) − ( 0 n )
Thus for n = 3 0 (as asked in problem), we get -
k = 1 ∑ 1 0 ( 3 k 3 0 ) = 3 ( 2 3 0 + ( − ω ) 3 0 + ( − ω 2 ) 3 0 ) − 1
= 3 1 0 7 3 7 4 1 8 2 4 + ω 3 0 + ω 6 0 − 1 = 3 1 0 7 3 7 4 1 8 2 4 + 1 + 1 − 1 = 3 5 7 9 1 3 9 4 1
whose last three digits are 9 4 1
(Note: here we had gaps of three so we used cube rots of unity, infact if we had binomial coeffeicients at gaps of n, then we had used nth roots of unity to get the result)