Proving the Evenness of (\stackrel{2n}{n}) Using the Binomial Theorem

ipitydatfu
Messages
13
Reaction score
0

Homework Statement



prove that (\stackrel{2n}{n}) is even when n \geq1

Homework Equations



as a hint they gave me this identity:
\stackrel{n}{k}= (n/k)(\stackrel{n-1}{k-1})

The Attempt at a Solution



by using that identity i got:

(\stackrel{2n}{n}) = (2n/n) (\stackrel{2n-1}{n-1})
= (2) (\stackrel{2n-1}{n-1})

i thought anything multiplied by 2 is an even number. but then again this is discrete math. how would i inductively show that this is true?
 
Physics news on Phys.org
That's pretty much it. The definition of "even number" is that it is of the form 2k for some integer k. Do you already know that \left(\begin{array}{c}n\\2i\end{array}\right) is always an integer?
 
oh yeah! I forgot about that! thanks!
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top