i = 0 ∑ ∞ j = 0 ∑ ∞ k = 0 ∑ ∞ 3 i 3 j 3 k 1 = n m , where i = j = k
The equation above holds true for positive coprime integers m and n . Find m + n .
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.
We can generalize this problem Sir. I had generalized it. :)
Log in to reply
Of course, we can. I will add it the solution.
We'll use three ideas to solve this. First, sum of a geometric series: for ∣ r ∣ < 1 , i = 0 ∑ ∞ r i = 1 − r 1
Secondly, the fact that, for sequences ( a i ) and ( b i ) with convergent series i , j = 0 ∑ ∞ a i b j = ( i , j = 0 ∑ ∞ a i ) ⋅ ( i , j = 0 ∑ ∞ b j )
(this can be seen by multiplying out the product term by term, and for full rigour, using partial sums)
Thirdly, we'll need to use the inclusion-exclusion principle.
The geometric series sums we'll need are i = 0 ∑ ∞ 3 i 1 i = 0 ∑ ∞ 9 i 1 i = 0 ∑ ∞ 2 7 i 1 = 2 6 2 7 = 2 3 = 8 9
Now we'll use these with the second identity above to define and find some sums related to our target sum. First, call the target itself S distinct i , j , k = 0 , ( i = j , i = k , j = k ) ∑ ∞ 3 i 3 j 3 k 1
Now we'll work out the sum when all indices are permitted (ie they don't have to be distinct): S all i , j , k = 0 ∑ ∞ 3 i 3 j 3 k 1 = ( i = 0 ∑ ∞ 3 i 1 ) 3 = 8 2 7
Next the sum when two of the indices (say j and k ) are the same, and the third can take any value: S two same i , j , k = 0 , j = k ∑ ∞ 3 i 3 j 3 k 1 = ( i = 0 ∑ ∞ 3 i 1 ) ( j = 0 ∑ ∞ 9 j 1 ) = 1 6 2 7
Finally the case when all three indices are equal, ie i = j = k : S three same i , j , k = 0 , i = j = k ∑ ∞ 3 i 3 j 3 k 1 = i = 0 ∑ ∞ 2 7 i 1 = 2 6 2 7
Lastly, we use inclusion-exclusion as follows: to find S distinct , start from S all . Now remove the cases when two of the indices are equal (note there are three of these corresponding to i = j , i = k and j = k respectively). However, each of these sums also includes the case when all three indices are the same; so we need to add back in two copies of this sum. In other words, S distinct = S all − 3 S two equal + 2 S three equal = 8 2 7 − 3 ⋅ 1 6 2 7 + 2 ⋅ 2 6 2 7 = 2 0 8 8 1
so that - at last - the answer is 2 8 9 .
This is correct, I did it same way
Problem Loading...
Note Loading...
Set Loading...
i = j = k ∑ ∞ 3 i 3 j 3 k 1 = 6 i < j < k ∑ ∞ 3 i 3 j 3 k 1 = 6 i = 0 ∑ ∞ 3 i 1 j = i + 1 ∑ ∞ 3 j 1 k = j + 1 ∑ ∞ 3 k 1 = 6 i = 0 ∑ ∞ 3 i 1 j = i + 1 ∑ ∞ 3 j 1 × 3 j + 1 1 × 1 − 3 1 1 = 6 i = 0 ∑ ∞ 3 i 1 j = i + 1 ∑ ∞ 3 2 j 1 × 2 1 = 3 i = 0 ∑ ∞ 3 i 1 × 9 i + 1 1 × 1 − 9 1 1 = 8 3 i = 0 ∑ ∞ 2 7 i 1 = 8 3 × 2 6 2 7 = 2 0 8 8 1 See Note.
Therefore m + n = 8 1 + 2 0 8 = 2 8 9 .
Generalization: i = j = k ≥ 0 ∑ ∞ n i + j + k 1 = ( n 3 − 1 ) ( n 2 − 1 ) ( n − 1 ) 6 n 3
Note: Consider the summation S ( i < j < k ) = ∑ i < j < k ∞ 3 i 3 j 3 k 1 . S i < j < k sums for all i but only j > i and k > j . Swapping j with k and do the same summation and add to the first one, S ( i < j < k ) + S ( i < k < j ) = 2 S ( i < j < k ) , we get the sum of i = j = k terms for all i . Let's denote it as S ( i = j = k ∣ i ) . Since we can interchange i , j , and k , we have S ( i = j = k ) = 3 S ( i = j = k ∣ i ) = 6 S ( i < j < k )