Find the number of 4 -tuple integers ( a , b , c , d ) such that a + b + c + d = 1 5 , where a ≥ − 1 , b ≥ − 2 , c ≥ − 3 , and d ≥ − 4 .
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.
I think you mean ( w , x , y , z ) = ( ( a + 1 ) , ( b + 2 ) , ( c + 3 ) , ( d + 4 ) ) with w + x + y + z = 2 5 ?
I think the link you wanted was: https://brilliant.org/wiki/identical-objects-into-distinct-bins/
and note ( w , x , y , z ) = ( ( a + 2 ) , ( b + 3 ) , ( c + 4 ) , ( d + 5 ) ) means w , x , y , z ≥ 1 .
The question is equivalent to finding non-negative integers ( A , B , C , D ) such that, A + B + C + D = 2 5 .
Separating 2 5 similar objects into 4 groups is equivalent to ordering 2 5 balls and 3 sticks, where the gaps between the sticks are the groups.
( eg O| | O O | O O represents ( 1 , 0 , 2 , 2 ) )
This can be done ( 3 2 8 ) ways.
Problem Loading...
Note Loading...
Set Loading...
If the conditions are a , b , c , d ≥ 0 then by distributing into bins ,
https://brilliant.org/wiki/distinct-objects-into-distinct-bins/
The number of 4 -tuple ( a , b , c , d ) is just ( 3 1 4 ) .
But we can make a + b + c + d = 1 5 into ( a + 2 ) + ( b + 3 ) + ( c + 4 ) + ( d + 5 ) = 2 9 which is also
w + x + y + z = 2 9 where w , x , y , z ≥ 0 and w = a + 2 , x = b + 3 , y = c + 4 , z = d + 5
Thus, by distributing into bins we have ( 3 2 8 ) ways of choosing ( w , x , y , z ) which is the same number of ways of choosing ( a , b , c , d )
as ( w , x , y , z ) = ( a + 2 , b + 3 , c + 4 , d + 5 ) which we can then find ( a , b , c , d ) .