How many non-negative integer solutions to the equation a + b + c + d + e + f + g + h = 1 0 have the properties that e = a + 3 , b is odd, c and d are even, and f = g ?
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.
hello im a new learner. can you explain to me how to get these explanation : "How many 6-tuples of non-negative integers sum to 3? Exactly (6+3−1 3)=(8 3)" really want to know about it. thanks :)
Log in to reply
http://en.wikipedia.org/wiki/Stars and bars_(combinatorics)
I use 50 points to see why I keep making the wrong answer and after that I notice I miss that c is even
Note: All numbers in the following solution are non-negative integers.
We know that e f = = a + 3 , g . Since b is odd, it can be expressed as 2 b ′ + 1 where b ′ . Similarly, c and d can be expressed as 2 c ′ and 2 d ′ , respectively. Substituting all this into our original equation gives a + b + c + d + e + f + g + h 2 a + 2 f + 2 b ′ + 1 + 2 c ′ + 2 d ′ + h + 3 = = 1 0 1 0 Taking both sides mod 2 gives h ≡ 0 ( m o d 2 ) so h can be expressed as 2 h ′ . We can substitute this and simplify further: 2 a + 2 f + 2 b ′ + 2 c ′ + 2 d ′ + h a + f + b ′ + c ′ + d ′ + h ′ = = 6 3 The number of solutions to this equation is clearly ( 3 8 ) = 5 6 by balls and urns.
whoops it's not balls and urns, it's stars and bars. darn I can't think at midnight.
Log in to reply
I thought they were the same thing. Can you explain the difference please?
Log in to reply
oh you're right i can't think even more at noon ;_;
I forgot the names of things ever since mathcounts ended.
Nice. I didn't notice h had to be even, and used a power series to find the solution from the second-to-last equation instead, but this is easier.
Log in to reply
Indeed, that was intentionally tricky. Finding the number of solutions where the coefficients are not all the same can get messy.
Let k = 2 b − 1 , l = 2 c , m = 2 d . Then the whole equation can be simplified into 2 a + 2 k + 2 l + 2 m + 2 f + h = 6 which we get that h is even. So it can be further simplified into a + k + l + m + f + n = 3 , where n = 2 h . No of soln to a + k + l + m + f + n = 3 is the no. of ways to put 2 sticks and 6 balls in a row. So ( 3 8 ) is our desired answer.
Could u further explain the 8C3 and putting 2 sticks and 6 balls in a row ?
This is the best way to do it.
sorry, i meant ( 3 8 )
We are given that there exist b ′ , c ′ , d ′ , ∈ N ∪ { 0 } b = 2 b ′ + 1 , c = 2 c ′ , d = 2 d ′ , hence 2 a + 2 b ′ + 2 c ′ + 2 d ′ + 2 f + h = 6 This forces 2 ∣ h , i.e. there exists h ′ ∈ N ∪ { 0 } such that h = 2 h ′ , so a + b ′ + c ′ + d ′ + f + h ′ = 3 Let a ′ = a + 1 , b ′ ′ = b ′ + 1 , c ′ ′ = c ′ + 1 , d ′ ′ = d ′ + 1 , f ′ = f + 1 , h ′ ′ = h ′ + 1 , then a ′ + b ′ ′ + c ′ ′ + d ′ ′ + f ′ + h ′ ′ = 9 and a ′ , b ′ ′ , c ′ ′ , d ′ ′ , f ′ , h ′ ′ are positive. The problem is readily seen to be equivalent with number of ways to separate 9 stars with 5 bars, as depicted in following figure ⋆ ∣ ⋆ ∣ ⋆ ⋆ ⋆ ∣ ⋆ ∣ ⋆ ⋆ ∣ ⋆ note that there are 8 gaps between the stars, hence the number sought is ( 5 8 ) = 3 ! 6 ⋅ 7 ⋅ 8 = 7 ⋅ 8 = 5 6
Since e = a + 3 and e = f , the given equation can be written as
2 a + b + c + d + 2 f + h = 7
Let b = 2 k + 1 , c = 2 m and d = 2 n where k , m , n ∈ { 0 , 1 , 2 . . . . } using the fact that b is odd and c and d are even. Rewriting the equation,
2 ( a + k + m + n + f ) + h = 6
Let a + k + m + n + f = x . The possible values of x are 0 , 1 , 2 and 3 . For these values, the integer solutions can be easily calculated.
When x = 0 , there is only 1 possible solution. For x = 1 , number of solutions is 5. Similarly for x = 2 and x = 3 , the number of solutions are 15 and 35 respectively. Adding them up,
1 + 5 + 1 5 + 3 5 = 5 6
nice one .... thanks a lot.
Since b is odd
We can express b as
b = 2 k + 1 where k is any non-negative integer.
Similarly, we can also express c and d as
c = 2 m and
d = 2 n where m and n
are also non-negative integers.
Using these, together with the fact that
e = a + 3
and
f = g ,
we will get a new equation as
a + 2 k + 1 + 2 m + 2 n + a + 3 + f + f + h = 1 0
which can be simplified to
2 a + 2 k + 2 m + 2 n + 2 f + h = 6 .
Now, h can only have four possible values: 0 , 2 , 4 or 6
Case 1
If h = 0 ,
The equation we got can be further simplified to:
a + k + m + n + f = 3
The number of non-negative solutions for that equation is given by
( 5 − 1 3 + 5 − 1 ) = ( 4 7 ) = 3 5
Case 2
If h = 2 ,
The equation we got can be further simplified to:
a + k + m + n + f = 2
The number of non-negative solutions for that equation is given by
( 5 − 1 2 + 5 − 1 ) = ( 4 6 ) = 1 5
Case 3
If h = 4 ,
The equation we got can be further simplified to:
a + k + m + n + f = 1
The number of non-negative solutions for that equation is given by
( 5 − 1 1 + 5 − 1 ) = ( 4 5 ) = 5
Case 2
If h = 6 ,
The equation we got can be further simplified to:
a + k + m + n + f = 0
The number of non-negative solutions for that equation is given by
( 5 − 1 0 + 5 − 1 ) = ( 4 4 ) = 1
Taking the sum of all possible cases, we have
3 5 + 1 5 + 5 + 1 = 5 6 possible non-negative integer solutions.
That should be Case 4
Let:
b = 2 b ′ + 1 , c = 2 c ′ , d = 2 d ′ , where b ′ , c ′ , d ′ ∈ [ 0 , . . . ] . Then,
a + b + c + d + e + f + g + h = 1 0
⟹ 2 ( a + b ′ + c ′ + d ′ + f ) + h = 6 .
Since { a , b ′ , c ′ , d ′ , f } are non negative, h is even.
Case 1: h = 0 . Then a = 0 , b = 1 , c = 0 , d = 0 , e = 3 , f = g = 0 is a unique solution.
Case 2: h = 4 . Then a + b ′ + c ′ + d ′ + f = 1 . So any one of the 5 variables a , b ′ , c ′ , d ′ , f can be 1 and all the others are 0. This can be chosen in ( 2 5 ) ways.
Case 3: h = 2 . Then a + b ′ + c ′ + d ′ + f = 2 . Then either one of the 5 variables is 2 and the rest are zero or any two of the 5 variables are 1 and the rest are zero. This can be chosen in ( 1 5 ) + ( 2 5 ) ways.
Case 3: h = 0 . In this case, there are 3 possibilities.
a) One variable is 3 and the rest are zero. This can be chosen in ( 1 5 ) ways.
b) One variable is 2, another variable is 1 and the rest are zero. This can be chosen in 2 ( 2 5 ) ways.
c) Three variables are 1 and the rest are zero. This can be chosen in ( 3 5 ) ways.
Add all these up, we have 1 + ( 1 5 ) + ( 1 5 ) + ( 2 5 ) + ( 1 5 ) + 2 ( 2 5 ) + ( 3 5 ) = 5 6 ways.
Problem Loading...
Note Loading...
Set Loading...
First, apply the given conditions. We write b = 2 j + 1 , c = 2 k , d = 2 m , e = a + 3 , g = f a + b + c + d + e + f + g + h a + 2 j + 1 + 2 k + 2 m + a + 3 + 2 f + h 2 ( a + j + k + m + f + 2 ) + h 2 ( a + j + k + m + f + n + 2 ) a + j + k + m + f + n + 2 a + j + k + m + f + n = 1 0 = 1 0 = 1 0 ⟹ h = 2 n = 1 0 = 5 = 3 How many 6 -tuples of non-negative integers sum to 3 ? Exactly ( 3 6 + 3 − 1 ) = ( 3 8 ) which comes out to 5 6 .