Let denote the number of ordered -ples solutions to an inequation such that:
.
If the number of solutions can be expressed as , find , where is the arithmetic mean of and .
Details and assumptions
For any there are two different binomial coefficients which satisfy
.
In this problem is the smallest possible value;
is the value of the greatest integer smaller than or equal to ;
Try my "Happy birthday to me (part 1)" if you liked this one.
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.
Suppose there are p objects (integer quantities) to be distributed to n rooms (variables). To separate n rooms, it is needed n − 1 "walls" between these rooms. Adding up these walls and objects, we'll have n + p − 1 elements. Since we want to distribute p objects performing simple combinations with the n + p − 1 elements, the number ( p n + p − 1 ) = ( n − 1 n + p − 1 ) represents the number of integer and non-negative solutions of an equation with n variables and p objects or integer quantities on the right-hand side. With some notation, we have:
S = # { x 1 , x 2 , . . . , x n ∈ N 0 ∣ x 1 + x 2 + . . . + x n = p } = ( n − 1 n + p − 1 ) .
Thus, an inequality is the sum of all the anterior results or number of solutions to the previous equations. Another way to determine the number of solutions to an inequality is to add up the quantity in the left-hand side that should make the inequality becomes equal to (and so, becomes an equality) a referred value in the right-hand side. This is equivalent to determine a new variable on the left-hand side, so that the number of the solutions to an inequality becomes:
S = # { x 1 , x 2 , . . . , x n ∈ N 0 ∣ x 1 + x 2 + . . . + x n < q }
S = # { x 1 , x 2 , . . . , x n + 1 ∈ N 0 ∣ x 1 + x 2 + . . . + x n + 1 = q }
S = ( q ( n + 1 ) + q − 1 ) = ( q n + q ) = ( n n + q ) .
Compute S = # { x 1 , x 2 , . . . , x 1 8 ∈ N 0 ∣ x 1 + x 2 + . . . + x 1 8 < 1 9 9 8 } is equivalent to calculate the number of solutions to every value lesser than or equal to 1 9 9 7 , which we must know if this is the part we want to neglect. This number is ( 1 8 1 8 + 1 9 9 6 ) = ( 1 8 2 0 1 4 ) .
Compute S = # { x 1 , x 2 , . . . , x 1 8 ∈ N 0 ∣ x 1 + x 2 + . . . + x 1 8 < 2 0 1 5 } is equivalent to calculate the number of solutions to every value lesser than or equal to 2 0 1 5 , which is the general solution from where we'll take down the part to be neglected. This number is ( 2 0 1 5 1 8 + 2 0 1 5 ) = ( 2 0 1 5 2 0 3 3 ) .
Now, we just have to subtract one from another, that is:
S = ( 2 0 1 5 2 0 3 3 ) − ( 1 8 2 0 1 4 ) = ( b a ) − ( c b − 1 )
Hence, the answer is ⌊ 3 a + b + c ⌋ = ⌊ 3 2 0 3 3 + 2 0 1 5 + 1 8 ⌋ = 1 3 3 5 .