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.
Let S = m , n ≥ 1 ∑ 2 m ( m 2 n + n 2 m ) m 2 n
We observe that the given sum is symmetric that means if we swap the variables m and n , the answer would still remain the same. Thus, we can state that
S = m , n ≥ 1 ∑ 2 m ( m 2 n + n 2 m ) m 2 n = n , m ≥ 1 ∑ 2 n ( m 2 n + n 2 m ) n 2 m
Adding the two sums, we get
2 S = = = = = m , n ≥ 1 ∑ 2 m ( m 2 n + n 2 m ) m 2 n + 2 n ( m 2 n + n 2 m ) n 2 m m , n ≥ 1 ∑ m 2 n + n 2 m m n ( 2 m m + 2 n n ) m , n ≥ 1 ∑ m 2 n + n 2 m m n ( 2 m 2 n m 2 n + n 2 m ) m , n ≥ 1 ∑ 2 m 2 n m n ( m ≥ 1 ∑ 2 m m ) 2
Now, using Geometric Expansion, we see that 1 − x 1 = n = 0 ∑ ∞ x n Differentiating the above series w.r.t x and then multiplying by x , we get ( 1 − x ) 2 x = n = 0 ∑ ∞ n x n
By setting x = 2 1 , we get the above required sum.
Thus, 2 S = ( ( 1 − 2 1 ) 2 2 1 ) 2 = 4
S = 2
EDIT : If you had a different approach then please do share it with us.