Skip to main content
Mathematics LibreTexts

23.4: Exercises

  • Page ID
    83520
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    Exercise \(\PageIndex{1}\)

    Choose numbers \(x,y\) so that the equality in the Binomial Theorem becomes

    \begin{equation*} \sum_{k=0}^n \binom{n}{k}\, 2^k = 3^n \text{.} \end{equation*}

    Exercise \(\PageIndex{2}\)

    1. Choose numbers \(x,y\) so that the equality in the Binomial Theorem becomes

    \begin{equation*} \binom{n}{0} \;\;-\;\; \binom{n}{1} \;\;+\;\; \binom{n}{2} \;\;-\;\; \binom{n}{3} \;\;+\;\; \cdots \;\;+\;\; (-1)^n \binom{n}{n} \;\;=\;\; 0\text{.} \end{equation*}

    1. The equality from Task a can be rearranged to yield

    \begin{gather*} \binom{n}{0} \;\;+\;\; \binom{n}{2} \;\;+\;\; \binom{n}{4} \;\;+\;\; \cdots \;\;+\;\; \binom{n}{m_1}\\ \;\;=\;\; \binom{n}{1} \;\;+\;\; \binom{n}{3} \;\;+\;\; \binom{n}{5} \;\;+\;\; \cdots \;\;+\;\; \binom{n}{m_2}\text{,} \end{gather*}
    where

    \begin{align*} m_1 & = \begin{cases} n, & n\text{ even}, \\ n-1, & n\text{ odd}, \\ \end{cases} & m_2 & = \begin{cases} n-1, & n\text{ even}, \\ n, & n\text{ odd}. \\ \end{cases} \end{align*}
    What does this rearranged formula tell you about the subsets of a set of size \(n\text{?}\)

    Hint.

    What is the sum on the left counting? What is the sum on the right counting?


    This page titled 23.4: Exercises is shared under a GNU Free Documentation License 1.3 license and was authored, remixed, and/or curated by Jeremy Sylvestre via source content that was edited to the style and standards of the LibreTexts platform; a detailed edit history is available upon request.

    • Was this article helpful?