Compute ( 1 1 0 0 ) + 2 ( 2 1 0 0 ) + … + 1 0 0 ( 1 0 0 1 0 0 ) . If your answer is k ⋅ 2 n , where n and k are positive integers and k is odd, find n + k .
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 forgot converting it into odd
This is so elegant... @Otto Bretscher
Log in to reply
It uses calculus, so it's not elegant ;)
Log in to reply
One could argue that Calculus is the most elegant system of thought ever developed. ;)
We will count the expression in two ways. Notice that if we have a committee of 1 0 0 people, the given expression is just the number of ways to choose a non-empty subcommittee, and then choose a president amoung the subcommittee.
However, this is equivalent to choosing the president first, and then deciding the people who are going to be in the subcommitte.
We can choose the president in 1 0 0 ways. Each of the other people have two choices: they are either in the subcommittee or they are not in the subcommitte, therefore this is 2 9 9 for all 99 other people.
Therefore, the number of ways is just 1 0 0 ⋅ 2 9 9 = 2 5 ⋅ 2 1 0 1 ⟹ 2 5 + 1 0 1 = 1 2 6
Note this gives us an identity: k = 1 ∑ n k ( k n ) = n ⋅ 2 n − 1
by the binomial theorm: n = 0 ∑ 1 0 0 ( n 1 0 0 ) = 2 1 0 0 we need to find S = n = 0 ∑ 1 0 0 n ( n 1 0 0 ) this equals S = 0 ( 0 1 0 0 ) + 1 ( 1 1 0 0 ) + 2 ( 2 1 0 0 ) + . . . . + 9 8 ( 9 8 1 0 0 ) + 9 9 ( 9 9 1 0 0 ) + 1 0 0 ( 1 0 0 1 0 0 ) take all n to be 100: S = 1 0 0 ( 0 1 0 0 ) + 1 0 0 ( 1 1 0 0 ) + . . . . + 1 0 0 ( 9 9 1 0 0 ) + 1 0 0 ( 1 0 0 1 0 0 ) − ( 1 0 0 ( 0 1 0 0 ) + 9 9 ( 1 1 0 0 ) + . . . + 1 ( 9 9 1 0 0 ) + 0 ( 1 0 0 1 0 0 ) ) since ( k n ) = ( n − k n ) : S = 1 0 0 ∗ 2 1 0 0 − ( 1 0 0 ( 1 0 0 1 0 0 ) + 9 9 ( 9 9 1 0 0 ) + . . . + 1 ( 1 1 0 0 ) + 0 ( 0 1 0 0 ) S = 1 0 0 ∗ 2 1 0 0 − S S = 1 0 0 ∗ 2 9 9 = 2 5 ∗ 2 1 0 1 2 5 + 1 0 1 = 1 2 6
Note that ( 0 n ) + ( 1 n ) + ( 2 n ) + . . . + ( n n ) = 2 n . From this fact, we do some algebra: ( 1 1 0 0 ) + 2 ( 2 1 0 0 ) + . . . + 1 0 0 ( 1 0 0 1 0 0 ) = k = 1 ∑ 1 0 0 k ( k 1 0 0 ) = k = 1 ∑ 1 0 0 k ( 1 0 0 − k ) ! k ! 1 0 0 ! = 1 0 0 k = 1 ∑ n ( 1 0 0 − k ) ! ( k − 1 ) ! ( 1 0 0 − 1 ) ! = 1 0 0 k = 1 ∑ n ( k − 1 9 9 ) = 1 0 0 ⋅ 2 9 9 = 2 5 ⋅ 2 1 0 1 . So our final answer must be 2 5 + 1 0 1 = 1 2 6 .
Nice work (upvote)! Just a detail: Your first sum should start with ( 0 n )
Log in to reply
Yes, you are right, it is now edited
Log in to reply
did the same thing but i wrote it as 100 X 2^99 and typed 199 as the answer . i think i need to read the problems more attentively
Take note that ( n r ) = ( n n − r )
Rewrite the equation, we get ( 1 0 0 9 9 ) + 2 ( 1 0 0 9 8 ) + 3 ( 1 0 0 9 7 ) + . . . + 1 0 0 ( 1 0 0 0 )
By rearranging, we get 1 0 0 ( ( 1 0 0 0 ) + 9 9 ( 1 0 0 1 ) + 9 8 ( 1 0 0 2 ) + . . . + ( 1 0 0 9 9 )
By adding with the original equation, we get 1 0 0 ( ( 1 0 0 0 ) + 1 0 0 ( 1 0 0 1 ) + 1 0 0 ( 1 0 0 2 ) + . . . + 1 0 0 ( 1 0 0 9 9 ) + 1 0 0 ( 1 0 0 1 0 0 ) = 1 0 0 ∑ r = 0 1 0 0 ( 1 0 0 r )
It is known that ∑ r = 0 n ( n r ) = 2 n
Thus, we get 2 k ⋅ 2 n = 1 0 0 ⋅ 2 1 0 0
k ⋅ 2 n = 5 0 ⋅ 2 1 0 0 = 2 5 ⋅ 2 1 0 1
Thus, k + n = 1 2 6
( 1 + x ) 1 0 0 ⇒ d x d ( 1 + x ) 1 0 0 1 0 0 ( 1 + [ 1 ] ) 9 9 ⇒ k + n = ( 1 0 0 0 ) + ( 1 0 0 1 ) x + ( 1 0 0 2 ) x 2 + . . . + ( 1 0 0 1 0 0 ) x 1 0 0 = ( 1 0 0 1 ) + 2 ( 1 0 0 2 ) x + 3 ( 1 0 0 3 ) x 2 + . . . + 1 0 0 ( 1 0 0 1 0 0 ) x 9 9 Put x = 1 = ( 1 0 0 1 ) + 2 ( 1 0 0 2 ) [ 1 ] + 3 ( 1 0 0 3 ) [ 1 ] + . . . + 1 0 0 ( 1 0 0 1 0 0 ) [ 1 ] = 1 0 0 ˙ 2 9 9 = 2 5 ˙ 2 1 0 1 = 2 5 + 1 0 1 = 1 2 6
veri gut...
Very neat! Thanks!
We have ( m n ) = ( m − n n ) and ( 1 n ) + ( 2 n ) + ⋯ + ( n − 1 n ) + ( n n ) = 2 n
Thus X = ( 1 1 0 0 ) + 2 ( 2 1 0 0 ) + ⋯ + 1 0 0 ( 1 0 0 1 0 0 ) = 1 0 0 ( ( 0 1 0 0 ) + ( 1 1 0 0 ) + ⋯ + ( 4 9 1 0 0 ) ) + 5 0 ( 5 0 1 0 0 )
X = 5 0 ( 2 ( ( 0 1 0 0 ) + ( 1 1 0 0 ) + ⋯ + ( 4 9 1 0 0 ) ) + ( 5 0 1 0 0 ) )
X = 5 0 ⋅ 2 1 0 0
X = 2 5 ⋅ 2 1 0 1
Problem Loading...
Note Loading...
Set Loading...
We have ( x + 1 ) 1 0 0 = ∑ k = 0 1 0 0 ( k 1 0 0 ) x k . Differentiation gives 1 0 0 ( x + 1 ) 9 9 = ∑ k = 0 1 0 0 k ( k 1 0 0 ) x k − 1 . Plug in x = 1 to find ∑ k = 0 1 0 0 k ( k 1 0 0 ) = 1 0 0 ( 2 9 9 ) = 2 5 ( 2 1 0 1 ) , with 2 5 + 1 0 1 = 1 2 6