Difference between revisions of "2006 Canadian MO Problems/Problem 1"
m (→Solution: box) |
|
(One intermediate revision by one other user not shown) | |
(No difference)
|
Latest revision as of 11:32, 30 November 2023
Problem
Let be the number of ways distributing
candies to
children so that each child receives at most two candies. For example,
,
, and
. Evaluate
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
2006 Canadian MO (Problems) | ||
Preceded by First question |
1 • 2 • 3 • 4 • 5 | Followed by Problem 2 |