Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

$8.$ ($6$ points) Verify that for any $n\ge k\ge 1$ $$\binom{n}2=\binom{k}2+k(n-k)+\binom{n-k}2\;.$$ $\quad$Then give a combinatorial argument for why this is true.

Hi I need help doing this problem

I know this is a given $\binom{n}{2} = \binom{k}{2} + k \cdot (k-1) \binom{n-l}{2}$

Also what is a combinatorial argument as well

share|cite|improve this question

HINT: Let $X$ be a set of $n$ objects; $\binom{n}2$ is the number of $2$-element subsets of $X$. Now split $X$ into two disjoint subsets $Y$ and $Z$ in such a way that $Y$ contains $k$ objects, and $Z$ contains the other $n-k$ objects. Split the $2$-element subsets of $X$ into those whose elements are both in $Y$, those with one element from $Y$ and one from $Z$, and those whose elements are both from $Z$. How big is each of those three sets of pairs?

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.