Sequence Killer!

Algebra Level 3

i = 0 j = 0 k = 0 1 3 i 3 j 3 k = m n , where i j k \sum_{i=0}^\infty \sum_{j=0}^\infty \sum_{k=0}^\infty \frac 1{3^i3^j3^k} = \frac mn, \quad \text{where }i \ne j \ne k

The equation above holds true for positive coprime integers m m and n n . Find m + n m+n .


The answer is 289.

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.

2 solutions

i j k 1 3 i 3 j 3 k = 6 i < j < k 1 3 i 3 j 3 k See Note. = 6 i = 0 1 3 i j = i + 1 1 3 j k = j + 1 1 3 k = 6 i = 0 1 3 i j = i + 1 1 3 j × 1 3 j + 1 × 1 1 1 3 = 6 i = 0 1 3 i j = i + 1 1 3 2 j × 1 2 = 3 i = 0 1 3 i × 1 9 i + 1 × 1 1 1 9 = 3 8 i = 0 1 2 7 i = 3 8 × 27 26 = 81 208 \begin{aligned} \sum_{i \ne j \ne k}^\infty \frac 1{3^i 3^j 3^k} & = 6 \sum_{i < j < k}^\infty \frac 1{3^i 3^j 3^k} & \small \blue{\text{See Note.}} \\ & = 6 \sum_{i=0}^\infty \frac 1{3^i} \sum_{j=i+1}^\infty \frac 1{3^j} \sum_{k=j+1}^\infty \frac 1{3^k} \\ & = 6 \sum_{i=0}^\infty \frac 1{3^i} \sum_{j=i+1}^\infty \frac 1{3^j} \times \frac 1{3^{j+1}} \times \frac 1{1-\frac 13} \\ & = 6 \sum_{i=0}^\infty \frac 1{3^i} \sum_{j=i+1}^\infty \frac 1{3^{2j}} \times \frac 12 \\ & = 3 \sum_{i=0}^\infty \frac 1{3^i} \times \frac 1{9^{i+1}} \times \frac 1{1-\frac 19} \\ & = \frac 38 \sum_{i=0}^\infty \frac 1{27^i} \\ & = \frac 38 \times \frac {27}{26} = \frac {81}{208} \end{aligned}

Therefore m + n = 81 + 208 = 289 m+n = 81+208 = \boxed{289} .

Generalization: i j k 0 1 n i + j + k = 6 n 3 ( n 3 1 ) ( n 2 1 ) ( n 1 ) \displaystyle \sum_{i\ne j\ne k \ge 0}^\infty \frac 1{n^{i+j+k}} = \frac {6n^3}{(n^3-1)(n^2-1)(n-1)}


Note: Consider the summation S ( i < j < k ) = i < j < k 1 3 i 3 j 3 k S(i<j<k) = \sum_{i < j < k}^\infty \frac 1{3^i3^j3^k} . S i < j < k S_{i<j<k} sums for all i i but only j > i j >i and k > j k > j . Swapping j j with k 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 ) S(i<j<k) + S(i<\red{k<j}) = 2 S(i<j<k) , we get the sum of i j k i\ne j \ne k terms for all i i . Let's denote it as S ( i j k i ) S(i\ne j \ne k \mid i) . Since we can interchange i i , j j , and k k , we have S ( i j k ) = 3 S ( i j k i ) = 6 S ( i < j < k ) S(i\ne j \ne k) = 3 S(i\ne j \ne k \mid i) = 6 S(i<j<k)

We can generalize this problem Sir. I had generalized it. :)

Naren Bhandari - 1 year, 2 months ago

Log in to reply

Of course, we can. I will add it the solution.

Chew-Seong Cheong - 1 year, 2 months ago
Chris Lewis
Mar 30, 2020

We'll use three ideas to solve this. First, sum of a geometric series: for r < 1 |r|<1 , i = 0 r i = 1 1 r \sum_{i=0}^{\infty} r^i=\frac{1}{1-r}

Secondly, the fact that, for sequences ( a i ) (a_i) and ( b i ) (b_i) with convergent series i , j = 0 a i b j = ( i , j = 0 a i ) ( i , j = 0 b j ) \sum_{i,j=0}^{\infty} a_i b_j = \left( \sum_{i,j=0}^{\infty} a_i \right) \cdot \left( \sum_{i,j=0}^{\infty} b_j \right)

(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 1 3 i = 3 2 i = 0 1 9 i = 9 8 i = 0 1 2 7 i = 27 26 \begin{aligned} \sum_{i=0}^{\infty} \frac{1}{3^i}&=\frac{3}{2} \\ \sum_{i=0}^{\infty} \frac{1}{9^i}&=\frac{9}{8} \\ \sum_{i=0}^{\infty} \frac{1}{27^i}=\frac{27}{26} \end{aligned}

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 ) 1 3 i 3 j 3 k S_{\text{distinct}} \sum_{i,j,k=0, \; (i \neq j,i \neq k,j \neq k)}^{\infty} \frac{1}{3^i 3^j 3^k}

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 1 3 i 3 j 3 k = ( i = 0 1 3 i ) 3 = 27 8 S_{\text{all}} \sum_{i,j,k=0}^{\infty} \frac{1}{3^i 3^j 3^k} = \left( \sum_{i=0}^{\infty} \frac{1}{3^i} \right)^3 = \frac{27}{8}

Next the sum when two of the indices (say j j and k k ) are the same, and the third can take any value: S two same i , j , k = 0 , j = k 1 3 i 3 j 3 k = ( i = 0 1 3 i ) ( j = 0 1 9 j ) = 27 16 S_{\text{two same}} \sum_{i,j,k=0, \; j=k}^{\infty} \frac{1}{3^i 3^j 3^k} = \left( \sum_{i=0}^{\infty} \frac{1}{3^i} \right)\left( \sum_{j=0}^{\infty} \frac{1}{9^j} \right) = \frac{27}{16}

Finally the case when all three indices are equal, ie i = j = k i=j=k : S three same i , j , k = 0 , i = j = k 1 3 i 3 j 3 k = i = 0 1 2 7 i = 27 26 S_{\text{three same}} \sum_{i,j,k=0, \; i=j=k}^{\infty} \frac{1}{3^i 3^j 3^k} = \sum_{i=0}^{\infty} \frac{1}{27^i} = \frac{27}{26}

Lastly, we use inclusion-exclusion as follows: to find S distinct S_{\text{distinct}} , start from S all S_{\text{all}} . Now remove the cases when two of the indices are equal (note there are three of these corresponding to i = j i=j , i = k i=k and j = k 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 = 27 8 3 27 16 + 2 27 26 = 81 208 S_{\text{distinct}} = S_{\text{all}}-3S_{\text{two equal}}+2S_{\text{three equal}}=\frac{27}{8}-3\cdot \frac{27}{16} + 2 \cdot \frac{27}{26} = \frac{81}{208}

so that - at last - the answer is 289 \boxed{289} .

This is correct, I did it same way

Mathoholic Oja - 1 year, 2 months ago

1 pending report

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...