Chapter 5: Problem 2
Fill in the rows of Pascal's triangle corresponding to \(n=9\) and \(10 .\)
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 5: Problem 2
Fill in the rows of Pascal's triangle corresponding to \(n=9\) and \(10 .\)
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(n\) be a positive integer. Prove that $$ \sum_{k=0}^{n}(-1)^{k}\left(\begin{array}{l} n \\ k \end{array}\right)^{2}=\left\\{\begin{array}{ll} 0 & \text { if } n \text { is odd } \\ (-1)^{m}\left(\begin{array}{c} 2 m \\ m \end{array}\right) & \text { if } n=2 m . \end{array}\right. $$ (Hint: For \(n=2 m\), consider the coefficient of \(x^{n}\) in \(\left(1-x^{2}\right)^{n}=(1+x)^{n}(1-x)^{n}\).)
\- Let \(S\) be a set of \(n\) elements. Prove that, if \(n\) is even, the only antichain of size \(\left(\begin{array}{l}\mathrm{n} \\\ \left.\frac{n}{2}\right]\end{array}\right)\) is the antichain of all \(\frac{n}{2}\) -subsets; if \(n\) is odd, prove that the only antichains of this size are the antichain of all \(\frac{n-1}{2}\) -subsets and the antichain of all \(\frac{n+1}{2}\) -subsets.
Prove that $$ \left(\begin{array}{l} r \\ k \end{array}\right)=\frac{r}{r-k}\left(\begin{array}{c} r-1 \\ k \end{array}\right) $$ for \(r\) a real number and \(k\) an integer with \(r \neq k\).
Prove by induction on \(n\) that, for \(n\) a positive integer, $$ \frac{1}{(1-z)^{n}}=\sum_{k=0}^{\infty}\left(\begin{array}{c} n+k-1 \\ k \end{array}\right) z^{k}, \quad|z|<1 . $$ Assume the validity of $$ \frac{1}{1-z}=\sum_{k=0}^{\infty} z^{k}, \quad|z|<1 . $$
Use the multinomial theorem to show that, for positive integers \(n\) and \(t\). $$ t^{n}=\sum\left(\begin{array}{c} n \\ n_{1} n_{2} \cdots n_{t} \end{array}\right) $$, where the summation extends over all nonnegative integral solutions \(n_{1}, n_{2}, \ldots, n_{t}\) of \(n_{1}+n_{2}+\cdots+n_{t}=n\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.