Problem

Source: Iranian National Olympiad (3rd Round) 2008

Tags: function, induction, combinatorics proposed, combinatorics



Prove that for each $ n$: \[ \sum_{k=1}^n\binom{n+k-1}{2k-1}=F_{2n}\]