Homework 1, Combinatorics, 2020 Fall, USTC

最新推荐文章于 2024-09-09 15:46:54 发布

Black_Boa

最新推荐文章于 2024-09-09 15:46:54 发布

阅读量79

点赞数

分类专栏： Combinatorics 文章标签：学习学习方法

ᓚᘏᗢ

本文链接：https://blog.csdn.net/Black_Boa/article/details/128472288

版权

Combinatorics 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Homework 1

Combinatorics, 2020 Fall, USTC

Let $n, r$ be positive integers and $n\ge r$ . Give a combinatorial proof of $\binom{r}{r}+ \binom{r+1}{r}+...+\binom{n}{r}=\binom{n+1}{r+1}.$
Let $n$ be a positive integer.
Prove that the identity $x^n=\sum_{k=1}^n S(n,k)(x)_k$ holds for every real number $x$ , where $S (n, k)$ is the Strirling number of the second kind, and $x)_k:=x(x-1)...(x-k+1)$ denotes a polynomial of degree $k$ with variable $x$ .
Hint: first prove the case when $x$ is a positive integer by double-counting certain mappings.
Let $n, r$ be integers satisfying $0\le r\le 2n$ . Find the value of $\sum_{i=0}^n (-1)^i\binom{n}{i}\binom{n}{r-i}$ .
For any integer $n\ge 2$ , let $\pi(n)$ be the number of primes in ${1,2,...,n\}$ .
1. Prove that the product of all primes $p$ satisfying $m<p\le 2m$ is at most $\binom{2m}{m}$ , where $m\ge 1$ is any integer.
2. Use (a) to prove that $\pi(n)\le \frac{Cn}{\log n}$ for some absolute constant $C$ . (Hint: by induction and use the estimation on $\binom{2m}{m}$ )
How many ways are there to seat $n$ couples at a round table with $2 n$ chairs in such a way that none of the couples sit next to each other?
If one seating plan can be obtained from other plan by a rotation, then we will view them as one plan.
Prove the following statements.
1. If $p$ is odd, then $|A_1\cup A_2\cup...\cup A_n|\le \sum_{k=1}^p (-1)^{k+1} S_k$ ;
2. If $p$ is even, then $|A_1\cup A_2\cup...\cup A_n|\ge \sum_{k=1}^p (-1)^{k+1} S_k.$
Here, $S_k$ is the sum of the sizes of all $k$ -fold intersections as defined in class.