Difference between revisions of "2025 SSMO Speed Round Problems/Problem 3"
m (→Solution) |
(→Solution) |
||
Line 8: | Line 8: | ||
<cmath>\tbinom{2}{2} + \tbinom{3}{2} + \cdots + \tbinom{14}{2}.</cmath> | <cmath>\tbinom{2}{2} + \tbinom{3}{2} + \cdots + \tbinom{14}{2}.</cmath> | ||
By the hockey stick identity, this is equal to <math>\tbinom{15}{3} = \boxed{455}</math>. | By the hockey stick identity, this is equal to <math>\tbinom{15}{3} = \boxed{455}</math>. | ||
+ | |||
+ | ~Sedro |
Latest revision as of 15:13, 9 September 2025
Problem
Anna is buying different types of cheese from the local supermarket. Let
and
be the number of pieces of blue, cheddar, and mozzarella cheese, respectively, that Anna buys. She can buy any nonnegative integer number of each type, but the total number of pieces must be at most 12. How many different combinations
of cheese can Anna buy? (Anna is allowed to buy 0 pieces of cheese.)
Solution
We seek the number of ordered pairs of nonnegative integers such that
. Let
be some integer. By stars and bars, there are
ordered pairs
of nonnegative integers satisfying
. Thus, the answer is the sum
By the hockey stick identity, this is equal to
.
~Sedro