2006 Canadian MO Problems/Problem 1

Problem

Let $f(n,k)$ be the number of ways distributing $k$ candies to $n$ children so that each child receives at most two candies. For example, $f(3,7)=0$ , $f(3,6)=1$ , and $f(3,4)=6$ . Evaluate $f(2006,1)+f(2006,4)+f(2006,7)+\dots+f(2006,1003)$ .

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

2006 Canadian MO

Page

Toolbox

Search

2006 Canadian MO Problems/Problem 1

Problem

Solution