i
=
j
,
j
=
k
,
k
=
i
∑
2
i
2
j
2
k
1
=
b
a
,
where
i
,
j
,
k
are distinct whole numbers.
If
a
,
b
are coprime positive integers, determine the value of
a
+
b
.
Clarifications on the summation
The summation runs over
all
triples
(
i
,
j
,
k
)
of pairwise non-negative integers. As an example,
(
1
,
3
,
2
)
and
(
1
,
0
,
8
)
are allowed but
(
3
,
3
,
2
)
,
(
0
,
0
,
0
)
,
(
0
,
0
,
3
)
and
(
7
,
7
,
7
)
aren't.
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.
Wow! I totally forgot about inclusion exclusion! Great
I wonder how to solve for n for a given A = ∑ 2 − ( a 1 + a 2 + ⋯ + a n ) for pairwise distinct a i 's.
This is something of a special case of Euler's work on the generating function of the partition function P .
Let us let S ( n ) be the sum S ( n ) = a 1 , a 2 , … , a n distinct a 1 , a 2 , … , a n ≥ 0 ∑ 2 − ( a 1 + a 2 + ⋯ + a n ) = n ! 0 ≤ a 1 < a 2 < ⋯ < a n ∑ 2 − ( a 1 + a 2 + ⋯ + a n ) , Then S ( n ) = n ! N ≥ 2 1 n ( n − 1 ) ∑ ∣ ∣ A ( N , n ) ∣ ∣ 2 − N , where A ( N , n ) is the set A ( N , n ) = { a ∈ N ∪ { 0 } n ∣ ∣ ∣ a 1 < a 2 < ⋯ < a n , j = 1 ∑ n a j = N } , N ≥ 2 1 n ( n − 1 ) . If we also consider the set B ( L , n ) = { b ∈ N ∪ { 0 } n ∣ ∣ ∣ j = 1 ∑ n ( n + 1 − j ) b j = L } , L ≥ 0 , then the mapping X : B ( N − 2 1 n ( n − 1 ) , n ) → A ( N , n ) given by the formula ( X b ) j = j − 1 + r = 1 ∑ j b r 1 ≤ j ≤ n , b ∈ B ( N − 2 1 n ( n − 1 ) , n ) is a bijection for any N ≥ 2 1 n ( n − 1 ) , and hence ∣ ∣ A ( N , n ) ∣ ∣ = ∣ ∣ B ( ( N − 2 1 n ( n − 1 ) , n ) ∣ ∣ .
But ∣ ∣ B ( L , n ) ∣ ∣ is the coefficient of t L in the series expansion of the product r = 1 ∏ n ( 1 − t r ) − 1 , and hence ∣ ∣ A ( N , n ) ∣ ∣ is the coefficient of t N in the series expansion of the product Q n ( t ) = t 2 1 n ( n − 1 ) r = 1 ∏ n ( 1 − t r ) − 1 = r = 1 ∏ n ( 1 − t r t r − 1 ) . Thus it follows that S ( n ) = n ! Q n ( 2 1 ) = n ! r = 1 ∏ n 2 r − 1 2 = n ! 2 n ( r = 1 ∏ n ( 2 r − 1 ) ) − 1 . In this case, we have S ( 3 ) = 1 × 3 × 7 3 ! × 2 3 = 7 1 6 , making the answer 1 6 + 7 = 2 3 .
Log in to reply
Yes. N ∪ { 0 } n is the set of n -tuples of nonnegative integers.
A mapping is another word for a function. Since I am saying that X is a bijection, you can read this whole bit as saying that X sets up a 1-1 correspondence between the two sets, if that is a more familiar expression to you.
Remember, X is a function between sets of n -tuples. If we start with the n -tuple b in B ( N − 2 1 n ( n − 1 ) , n ) , then X b is the n -tuple (call it a ) whose coefficients are a j = j − 1 + r = 1 ∑ j b r , 1 ≤ j ≤ n . I am using the standard notational abbreviation a to represent the n -tuple ( a 1 , a 2 , … , a n ) , and similarly for b . You need to check that X b actually belongs to A ( N , n ) (that is the point of X ) and that X has an inverse, so that every element of A ( N , n ) is equal to X b for a unique element b in B ( N − 2 1 n ( n − 1 ) , n ) . You retrieve b from a = X b by the formula b j = { a 1 a j − a j − 1 − 1 j = 1 2 ≤ j ≤ n .
Log in to reply
Thank you for your reply. Even if I accept that the function A ( N , n ) is carefully constructed, I still couldn't for the life of me figure out how you managed to pull the function of B ( L , n ) out of nowhere. That's some outstanding detective work!
Will read your solution again once my head is not about to explode.
Log in to reply
@Pi Han Goh – There are standard combinatoric tricks for converting sets of strictly increasing n -tuples into sets of just increasing n -tuples, or even (as I did in this case) into sets of n -tuples of nonnegative numbers. Generally speaking, it is easier to identify what a set of n -tuples is doing if there are as few restrictions on the shape of its elements as possible; going from a 1 < a 2 < ⋯ < a n to b 1 , b 2 , … b n ≥ 0 was a big simplification, and it seemed to me worth the while (to be more accurate, I have read about how to derive the generating function for the partition function P , and this calculation is similar), to investigate what would happen if we made this conversion. As you can see, it worked!
Where did I get B ( L , n ) from? It was forced on me. The formula b j = { a 1 a j − a j − 1 − 1 j = 1 2 ≤ j ≤ n . is one of those standard tricks for converting an n -tuple a with a 1 < a 2 < ⋯ < a n into an n -tuple b with b 1 , b 2 , … , b n ≥ 0 . Check out what the requirement that the components of a add to N has on the components of b , and out pops the sum requirement of B ( L , n ) , for L = N − 2 1 n ( n − 1 ) .
I have so many questions and I don't know where to begin, so let me just ask whatever that appears the most confusing:
Question 01 : How did you convert this first S ( n ) to the second S ( n ) ?
S ( n ) = a 1 , a 2 , … , a n distinct a 1 , a 2 , … , a n ≥ 0 ∑ 2 − ( a 1 + a 2 + ⋯ + a n ) = n ! 0 ≤ a 1 < a 2 < ⋯ < a n ∑ 2 − ( a 1 + a 2 + ⋯ + a n ) ,
to
S ( n ) = n ! N ≥ 2 1 n ( n − 1 ) ∑ ∣ ∣ A ( N , n ) ∣ ∣ 2 − N ,
(Yes, I've read your definition of A ( N , n ) = … already and I'm still clueless)
Question 02 : what does a ∈ N ∪ { 0 } n means? Does it mean a vector called a , with all non-negative integer elements right?
Question 03 : Can you explain to me what this means? Mapping? Do you mean a one-to-one relation?
then the mapping X : B ( N − 2 1 n ( n − 1 ) , n ) → A ( N , n ) given by the formula
Question 04 : What does ( X b ) j = j − 1 + r = 1 ∑ j b r means? What ( X b ) j means exactly? I didn't see this notation before in your solution.
i dont know why i am getting 16/3
Log in to reply
Unless you explain how you are getting 3 1 6 , I cannot explain what you have done wrong!
Hey, can you please give an easy explanation for maybe a high school grade math student (me)?
I didn't get the step from where you changed the sum S(n) to something in |A(N, n)|. The rest is pretty overwhelming!
Log in to reply
Have a look at the reply I gave to Pi Han almost two years ago. That should explain things.
Problem Loading...
Note Loading...
Set Loading...
We'll solve the problem using inclusion-exclusion principle.
We first calculate the value without the condition that i , j , k are distinct. ∑ 2 i 2 j 2 k 1 = ∑ 2 × 2 i 2 j 1 = ∑ 2 × 2 × 2 i 1 = 8
Now we need to remove the extra value in our sum by removing all those cases which do not satisfy our condition. We consider the case that two of our variables are equal without any restriction on the third variable.
∑ 2 i 2 j 2 k 1 = ∑ 2 2 i 2 k 1 = ∑ 2 × 2 2 i 1 = 2 . 3 4 = 3 8
There will be 3 such cases, namely i = j , j = k and k = i . So we need to subtract three times this value from our previously calculated value. But doing so, we've also removed the case when all three variables are equal thrice. Since we want to remove this case only once, we add twice its value. ∑ 2 i 2 j 2 k 1 = ∑ 2 3 i 1 = 7 8 8 − 3 × 3 8 + 2 × 7 8 = 7 1 6
Since 1 6 , 7 are co-prime, the answer will be 2 3 .