How many integer solutions?

How many non-negative integer solutions to the equation a + b + c + d + e + f + g + h = 10 a + b + c + d + e + f + g + h = 10 have the properties that e = a + 3 , e = a + 3, b b is odd, c c and d d are even, and f = g ? f = g?


The answer is 56.

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.

7 solutions

Andrew Edwards
Sep 8, 2013

First, apply the given conditions. We write b = 2 j + 1 , c = 2 k , d = 2 m , e = a + 3 , g = f b=2j+1,c=2k, d=2m, e=a+3, g=f a + b + c + d + e + f + g + h = 10 a + 2 j + 1 + 2 k + 2 m + a + 3 + 2 f + h = 10 2 ( a + j + k + m + f + 2 ) + h = 10 h = 2 n 2 ( a + j + k + m + f + n + 2 ) = 10 a + j + k + m + f + n + 2 = 5 a + j + k + m + f + n = 3 \begin{aligned} a+b+c+d+e+f+g+h &= 10 \\ a+2j+1+2k+2m+a+3+2f+h&=10\\ 2(a+j+k+m+f+2)+h &=10 \implies h = 2n \\ 2(a+j+k+m+f+n+2) &= 10 \\ a+j+k+m+f+n+2 &= 5 \\ a+j+k+m+f+n &= 3\end{aligned} How many 6 6 -tuples of non-negative integers sum to 3 3 ? Exactly ( 6 + 3 1 3 ) = ( 8 3 ) \binom{6 + 3 - 1}{3} = \binom{8}{3} which comes out to 56 \boxed{56} .

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 :)

Alvian Hilman - 7 years, 9 months ago

I use 50 points to see why I keep making the wrong answer and after that I notice I miss that c is even

Hao Tian Lee - 7 years, 9 months ago
Ryan Soedjak
Sep 8, 2013

Note: All numbers in the following solution are non-negative integers.

We know that e = a + 3 , f = g . \begin{aligned}e&=&a+3,\\f&=&g.\end{aligned} Since b b is odd, it can be expressed as 2 b + 1 2b'+1 where b b' . Similarly, c c and d d can be expressed as 2 c 2c' and 2 d 2d' , respectively. Substituting all this into our original equation gives a + b + c + d + e + f + g + h = 10 2 a + 2 f + 2 b + 1 + 2 c + 2 d + h + 3 = 10 \begin{aligned}a+b+c+d+e+f+g+h&=&10\\2a+2f+2b'+1+2c'+2d'+h+3&=&10\end{aligned} Taking both sides mod 2 \text{mod 2} gives h 0 ( m o d 2 ) h\equiv0\pmod2 so h h can be expressed as 2 h 2h' . We can substitute this and simplify further: 2 a + 2 f + 2 b + 2 c + 2 d + h = 6 a + f + b + c + d + h = 3 \begin{aligned}2a+2f+2b'+2c'+2d'+h&=&6\\a+f+b'+c'+d'+h'&=&3\end{aligned} The number of solutions to this equation is clearly ( 8 3 ) = 56 \binom83=\boxed{56} by balls and urns.

whoops it's not balls and urns, it's stars and bars. darn I can't think at midnight.

Ryan Soedjak - 7 years, 9 months ago

Log in to reply

I thought they were the same thing. Can you explain the difference please?

Gilbert Simmons - 7 years, 9 months ago

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.

Ryan Soedjak - 7 years, 8 months ago

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.

Etienne Vouga - 7 years, 9 months ago

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.

Calvin Lin Staff - 7 years, 9 months ago
Matthew Fan
Sep 8, 2013

Let k = b 1 2 , l = c 2 , m = d 2 k=\frac{b-1}{2},l=\frac{c}{2},m=\frac{d}{2} . Then the whole equation can be simplified into 2 a + 2 k + 2 l + 2 m + 2 f + h = 6 2a+2k+2l+2m+2f+h=6 which we get that h h is even. So it can be further simplified into a + k + l + m + f + n = 3 a+k+l+m+f+n=3 , where n = h 2 n=\frac{h}{2} . No of soln to a + k + l + m + f + n = 3 a+k+l+m+f+n=3 is the no. of ways to put 2 sticks and 6 balls in a row. So ( 8 3 ) \binom{8}{3} is our desired answer.

Could u further explain the 8C3 and putting 2 sticks and 6 balls in a row ?

Fan Zhang - 7 years, 9 months ago

This is the best way to do it.

Mirza Baig - 7 years, 9 months ago

sorry, i meant ( 8 3 ) \binom{8}{3}

Matthew Fan - 7 years, 9 months ago
Jan J.
Sep 9, 2013

We are given that there exist b , c , d , N { 0 } b',c',d', \in \mathbb{N} \cup \{0\} b = 2 b + 1 b = 2b' + 1 , c = 2 c c = 2c' , d = 2 d d = 2d' , hence 2 a + 2 b + 2 c + 2 d + 2 f + h = 6 2a + 2b' + 2c' + 2d' + 2f + h = 6 This forces 2 h 2 \mid h , i.e. there exists h N { 0 } h' \in \mathbb{N} \cup \{0\} such that h = 2 h h = 2h' , so a + b + c + d + f + h = 3 a + b' + c' + d' + f + h' = 3 Let a = a + 1 a' = a + 1 , b = b + 1 b'' = b' + 1 , c = c + 1 c'' = c' + 1 , d = d + 1 d'' = d' + 1 , f = f + 1 f' = f + 1 , h = h + 1 h'' = h' + 1 , then a + b + c + d + f + h = 9 a' + b'' + c'' + d'' + f' + h'' = 9 and a , b , c , d , f , h a', b'',c'', d'', f', h'' are positive. The problem is readily seen to be equivalent with number of ways to separate 9 9 stars with 5 5 bars, as depicted in following figure \star \mid \star \mid \star \star \star \mid \star \mid \star \star \mid \star note that there are 8 8 gaps between the stars, hence the number sought is ( 8 5 ) = 6 7 8 3 ! = 7 8 = 56 \binom{8}{5} = \frac{6 \cdot 7 \cdot 8}{3!} = 7 \cdot 8 = \boxed{56}

Pranav Arora
Sep 10, 2013

Since e = a + 3 e=a+3 and e = f e=f , the given equation can be written as

2 a + b + c + d + 2 f + h = 7 2a+b+c+d+2f+h=7

Let b = 2 k + 1 b=2k+1 , c = 2 m c=2m and d = 2 n d=2n where k , m , n { 0 , 1 , 2.... } k,m,n \in \{ 0,1,2.... \} using the fact that b b is odd and c c and d d are even. Rewriting the equation,

2 ( a + k + m + n + f ) + h = 6 2(a+k+m+n+f)+h=6

Let a + k + m + n + f = x a+k+m+n+f=x . The possible values of x x are 0 , 1 , 2 0,1,2 and 3 3 . For these values, the integer solutions can be easily calculated.

When x = 0 x=0 , there is only 1 possible solution. For x = 1 x=1 , number of solutions is 5. Similarly for x = 2 x=2 and x = 3 x=3 , the number of solutions are 15 and 35 respectively. Adding them up,

1 + 5 + 15 + 35 = 56 1+5+15+35=\fbox{56}

nice one .... thanks a lot.

SWAPNESH KUMAR - 7 years, 8 months ago
Riemann Soliven
Sep 10, 2013

Since b b is odd

We can express b b as

b = 2 k + 1 b=2k+1 where k k is any non-negative integer.

Similarly, we can also express c c and d d as

c = 2 m c=2m and

d = 2 n d=2n where m m and n n

are also non-negative integers.

Using these, together with the fact that

e = a + 3 e=a+3

and

f = g f=g ,

we will get a new equation as

a + 2 k + 1 + 2 m + 2 n + a + 3 + f + f + h = 10 a+2k+1+2m+2n+a+3+f+f+h=10

which can be simplified to

2 a + 2 k + 2 m + 2 n + 2 f + h = 6 2a+2k+2m+2n+2f+h=6 .

Now, h h can only have four possible values: 0 , 2 , 4 0, 2, 4 or 6 6

Case 1

If h = 0 h=0 ,

The equation we got can be further simplified to:

a + k + m + n + f = 3 a+k+m+n+f=3

The number of non-negative solutions for that equation is given by

( 3 + 5 1 5 1 ) = ( 7 4 ) = 35 {3+5-1 \choose 5-1}={7 \choose 4}=35

Case 2

If h = 2 h=2 ,

The equation we got can be further simplified to:

a + k + m + n + f = 2 a+k+m+n+f=2

The number of non-negative solutions for that equation is given by

( 2 + 5 1 5 1 ) = ( 6 4 ) = 15 {2+5-1 \choose 5-1}={6 \choose 4}=15

Case 3

If h = 4 h=4 ,

The equation we got can be further simplified to:

a + k + m + n + f = 1 a+k+m+n+f=1

The number of non-negative solutions for that equation is given by

( 1 + 5 1 5 1 ) = ( 5 4 ) = 5 {1+5-1 \choose 5-1}={5 \choose 4}=5

Case 2

If h = 6 h=6 ,

The equation we got can be further simplified to:

a + k + m + n + f = 0 a+k+m+n+f=0

The number of non-negative solutions for that equation is given by

( 0 + 5 1 5 1 ) = ( 4 4 ) = 1 {0+5-1 \choose 5-1}={4 \choose 4}=1

Taking the sum of all possible cases, we have

35 + 15 + 5 + 1 = 56 35+15+5+1=56 possible non-negative integer solutions.

That should be Case 4

Riemann Soliven - 7 years, 9 months ago

Let:

b = 2 b + 1 b = 2b'+1 , c = 2 c c=2c' , d = 2 d d=2d' , where b , c , d [ 0 , . . . ] b',c',d' \in [0,...] . Then,

a + b + c + d + e + f + g + h = 10 a+b+c+d+e+f+g+h=10

2 ( a + b + c + d + f ) + h = 6 \implies 2(a+b'+c'+d'+f)+h=6 .

Since { a , b , c , d , f } \{a,b',c',d',f\} are non negative, h h is even.

Case 1: h = 0 h=0 . Then a = 0 , b = 1 , c = 0 , d = 0 , e = 3 , f = g = 0 a=0,b=1,c=0,d=0,e=3,f=g=0 is a unique solution.

Case 2: h = 4 h=4 . Then a + b + c + d + f = 1 a+b'+c'+d'+f=1 . So any one of the 5 variables a , b , c , d , f a,b',c',d',f can be 1 and all the others are 0. This can be chosen in ( 5 2 ) 5 \choose 2 ways.

Case 3: h = 2 h=2 . Then a + b + c + d + f = 2 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 ( 5 1 ) 5 \choose 1 + ( 5 2 ) 5 \choose 2 ways.

Case 3: h = 0 h=0 . In this case, there are 3 possibilities.

a) One variable is 3 and the rest are zero. This can be chosen in ( 5 1 ) 5 \choose 1 ways.

b) One variable is 2, another variable is 1 and the rest are zero. This can be chosen in 2 ( 5 2 ) 2{5 \choose 2} ways.

c) Three variables are 1 and the rest are zero. This can be chosen in ( 5 3 ) 5 \choose 3 ways.

Add all these up, we have 1 + ( 5 1 ) + ( 5 1 ) + ( 5 2 ) + ( 5 1 ) + 2 ( 5 2 ) + ( 5 3 ) = 56 1+{5 \choose 1} + {5 \choose 1} + {5 \choose 2} + {5 \choose 1} + 2{5 \choose 2}+{5 \choose 3}=56 ways.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...