Find the sum: i = 0 ∑ 1 0 0 j = 0 ∑ 1 0 0 ( i + j 2 0 0 ) ( i 1 0 0 ) ( j 1 0 0 )
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.
Problem Loading...
Note Loading...
Set Loading...
This Problem is inspired by the "Point Path Probability" https://brilliant.org/mathematics-problem/point-path-probability
Let's show i = 0 ∑ n j = 0 ∑ n ( i + j 2 n ) ( i n ) ( j n ) = 2 n + 1 Rearranging, we have: i = 0 ∑ n j = 0 ∑ n ( i + j 2 n ) ( i n ) ( j n ) = k = 0 ∑ 2 n ( k 2 n ) 1 i + j = k ∑ ( i n ) ( j n ) = k = 0 ∑ 2 n ( k 2 n ) 1 ( k 2 n ) = 2 n + 1 Where we applied Vandermonde's Identity above.
The second method is using double counting the pairs (s,p) where the point s is on the path p in the "Point Path Probability" problem: i = 0 ∑ n j = 0 ∑ n ( i i + j ) ( n − i 2 n − ( i + j ) ) = ( 2 n + 1 ) ( n 2 n ) This is equivalent to the first identity by a simple algebraic manipulation.
Let n = 1 0 0 , the answer to the problem is 2 0 1 .