MHB Is \binom{n}{r} even for even n and odd r?

  • Thread starter Thread starter mathgirl1
  • Start date Start date
  • Tags Tags
    Combinations even
mathgirl1
Messages
21
Reaction score
0
Prove that if n is even and r is odd then $$\binom{n}{r}$$ is even.

Solution: I know I have these two equalities
$$\binom{n}{r} = \binom{n-1}{r-1} + \binom{n-1}{r}=\frac{n(n-1)...(n-r+1)}{r!}$$

Now if n is even and r is odd then (n-r+1) is even. So it seems that we will have at least one more even number on the numerator than is in the denominator thus making the whole thing even. However, I am not sure how to show this. Also, part a of this questions was to show $$\binom{n}{r} = \binom{n-1}{r-1} + \binom{n-1}{r}$$ and my professor usually gives part b that uses part a. But I am not sure how to use part a to show this without using the definition. I know the only case we would have to look at is if one is even and one is odd and then show a contradiction I guess? But I didn't get very far with this approach. Any help is much appreciated.

Thanks in advance!
 
Mathematics news on Phys.org
Hi mathgirl,
Here's a solution, but it does not use the additive property that you cited, except maybe this was used to show every binomial coefficient is an integer.

Let $n$ and $r$ be positive integers with $1\leq r\leq n$ (so $n-r+1\neq0$). Then
$$\binom{n}{r}={n!\over r!(n-r)!}={(n-r+1)n!\over r(r-1)!(n-r+1)!}={n-r+1\over r}\binom{n}{r-1}$$

Now assume $n$ is even and $r$ is odd. Then $n-r+1$ is even and from
$$r\binom{n}{r}=(n-r+1)\binom{n}{r-1}$$
it follows that
$$r\binom{n}{r}$$ is even. Since $r$ is odd, $$\binom{n}{r}$$ is even.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
11
Views
3K
Replies
7
Views
2K
Replies
2
Views
2K
Replies
6
Views
2K
Replies
28
Views
5K
Replies
8
Views
3K
Back
Top