If the value of
i
=
0
∑
∞
j
=
0
∑
∞
k
=
0
∑
∞
3
i
3
j
3
k
1
(
i
=
j
=
k
)
Can be represented as n m
Then find
m × n
Note : You are asked to find the summation over all ordered triplets of distinct non-negative integers.
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.
Similar to how I did it. I found 3 ! i = 2 ∑ ∞ j = 1 ∑ i − 1 k = 0 ∑ j − 1 3 − ( i + j + k ) But this is better.
i = 0 ∑ ∞ j = 0 ∑ ∞ k = 0 ∑ ∞ = [ sum when i,j,k are independent ] − 3 × [ sum when any 2 of i,j,k are equal ] + 2 × [ sum when i = j = k ]
= i = 0 ∑ ∞ j = 0 ∑ ∞ k = 0 ∑ ∞ 3 i 3 j 3 k 1 − 3 i = 0 ∑ ∞ k = 0 ∑ ∞ 9 i 3 k 1 + 2 i = 0 ∑ ∞ 2 7 i 1
= ( 2 3 ) 3 − 3 ( 8 9 ) ( 2 3 ) + 2 ( 2 6 2 7 )
= 2 0 8 8 1
8 1 × 2 0 8 = 1 6 8 4 8
@Krishna Sharma Will you please generalise it For any n number of sigma ?? Thanks.
Log in to reply
What do you get when you try and generalize his approach?
Do you know how to do
i = 0 ∑ ∞ j = 0 ∑ ∞ 3 i 3 j 1 ?
Log in to reply
This got to be equal to 8 9 if i and j are not equal...
Will you please elaborate why 2× when I=j=k
clearly we can see that i , j , k are different
instead of solving it we can apply the method we use in
combinatorics , for example to find permutations of telephone
numbers in a telephone directory which do not end with 4
then we do this simple method that is total - numbers ending with 4
Similarly
here y = infinity
t o t a l = ( ∑ i = 0 y 3 i 1 ) 3
when i = k not equal to j
here
= ( ∑ i = 0 y 3 2 i 1 ) ( ∑ i = 0 y 3 j 1 )
= ∑ i = 0 y 3 2 i 1 ( 2 3 − 3 i 1
= 1 6 2 7 − 2 6 2 7 = 8 . 2 6 1 3 5
Required sum is
= 8 2 7 − 2 6 2 7 − 3 . 8 . 2 6 1 3 5 = 2 0 8 8 1
m.n =16848
very good question Krishna Sharma , enjoyed very much,continue to give such more
A simple simplification will do like i = 0 ∑ ∞ j = 0 ∑ ∞ k = 0 ∑ ∞ i = j = k 3 i 3 j 3 k 1 = i = 0 ∑ ∞ j = 0 ∑ ∞ i = j 3 i 3 j 1 ( k = 0 ∑ ∞ 3 k 1 − 3 i 1 − 3 j 1 ) = i = 0 ∑ ∞ j = 0 ∑ ∞ i = j 3 i 3 j 1 ( 1 − 3 1 1 − 3 i 1 − 3 j 1 ) = i = 0 ∑ ∞ j = 0 ∑ ∞ i = j 3 i 3 j 1 2 3 − i = 0 ∑ ∞ j = 0 ∑ ∞ i = j 3 2 i 3 j 1 − i = 0 ∑ ∞ j = 0 ∑ ∞ i = j 3 i 3 2 j 1 = 2 3 i = 0 ∑ ∞ 3 i 1 ( j = 0 ∑ ∞ 3 j 1 − 3 i 1 ) − i = 0 ∑ ∞ 3 2 i 1 ( j = 0 ∑ ∞ 3 j 1 − 3 i 1 ) − i = 0 ∑ ∞ 3 i 1 ( j = 0 ∑ ∞ 3 2 j 1 − 3 2 i 1 ) = 2 3 i = 0 ∑ ∞ 3 i 1 ( 1 − 3 1 1 − 3 i 1 ) − i = 0 ∑ ∞ 3 2 i 1 ( 1 − 3 1 1 − 3 i 1 ) − i = 0 ∑ ∞ 3 i 1 ( 1 − 9 1 1 − 3 2 i 1 ) = 2 3 i = 0 ∑ ∞ 3 i 1 ( 2 3 − 3 i 1 ) − i = 0 ∑ ∞ 3 2 i 1 ( 2 3 − 3 i 1 ) − i = 0 ∑ ∞ 3 i 1 ( 8 9 − 3 2 i 1 ) = 2 3 i = 0 ∑ ∞ ( 3 i 1 2 3 − 3 2 i 1 ) − i = 0 ∑ ∞ ( 3 2 i 1 2 3 − 3 3 i 1 ) − i = 0 ∑ ∞ ( 3 i 1 8 9 − 3 3 i 1 ) = 2 3 ( 1 − 3 1 1 2 3 − 1 − 9 1 1 ) − ( 1 − 9 1 1 2 3 − 1 − 2 7 1 1 ) − ( 1 − 3 1 1 8 9 − 1 − 2 7 1 1 ) = 2 3 ( 2 3 2 3 − 8 9 ) − ( 8 9 2 3 − 2 6 2 7 ) − ( 2 3 8 9 − 2 6 2 7 ) = 8 2 7 − 1 6 3 ∗ 2 7 + 2 6 2 ∗ 2 7 = 1 6 2 ∗ 2 7 − 1 6 3 ∗ 2 7 + 2 6 2 ∗ 2 7 = 2 6 2 ∗ 2 7 − 1 6 2 7 = 2 ∗ 1 3 ∗ 8 1 6 ∗ 2 7 − 1 3 ∗ 2 7 = 2 ∗ 1 3 ∗ 8 3 ∗ 2 7
so the answer is 3 ∗ 2 7 ∗ 2 ∗ 1 3 ∗ 8 = 1 6 8 4 8
Problem Loading...
Note Loading...
Set Loading...
First, let's suppose (for the time being) that we only need to sum for values such that i < j < k . That is, let's find the following sum: i = 0 ∑ ∞ j = i + 1 ∑ ∞ k = j + 1 ∑ ∞ 3 i 3 j 3 k 1 = i = 0 ∑ ∞ 3 i 1 j = i + 1 ∑ ∞ 3 j 1 k = j + 1 ∑ ∞ 3 k 1 = i = 0 ∑ ∞ 3 i 1 j = i + 1 ∑ ∞ 3 j 1 1 − 1 / 3 1 / 3 j + 1 = 2 1 i = 0 ∑ ∞ 3 i 1 j = i + 1 ∑ ∞ 9 j 1 = 2 1 i = 0 ∑ ∞ 3 i 1 1 − 1 / 9 1 / 9 i + 1 = 1 6 1 i = 0 ∑ ∞ 2 7 i 1 = 1 6 1 ∗ 2 6 2 7 = 4 1 6 2 7
Now all we need to do is multiply this sum by 6, since there are exactly 6 different possibilities for how i , j , k are ordered. Therefore, the total sum is 4 1 6 2 7 ∗ 6 = 2 0 8 8 1 . Therefore the answer is 8 1 ∗ 2 0 8 = 1 6 8 4 8 .