Prove that for all K > 0, (2k choose k) is an even number.
For the assertion is true.
Cancelling where possible we have:
Now the power of in the prime factorization of is exactly (easy proof by induction). But the power of 2 in the prime factorization of is less than (another easy proof by induction) and therefore the quotient must be even.