排列组合问题

排列组合几大方法
两个必须相邻用捆绑法
必须分开用插空法
分组问题（每组最少一个）插板法
分组问题（每组最少没有）插板法（不过里面的球数要加上板数）
一些定理：
$$\begin{gathered} BinomialTheorem:(x+y{)}^n=C_n^0{x}^n+...C_n^n{y}^n \\ {C}_n^r=C_{n-1}^{r-1}+C_{n-1}^r \\ PrincipalofInclusionandExclusion(PIE): \\ P(A+B+C)=P(A)+P(B)+P(C)-P(A+B) \\ -P(B+C)-P(C+A)+P(A+B+C) \end{gathered}$$

1

The Smith family has 4 sons and 3 daughters. In how many ways can they be seated in a row of 7 chairs, such that at least 2 boys are next to each other?
Solution
The only case when 2 boys don’t next to each other is BGBGBGB, 4!*3!, so the overall solution is 7! - 4!*3! = 4896
Alert:Don’t use bagging methods to view 2 boys as one thing, becuase it will cause some replication.

2

I flip a coin 10 times.What is the expected number of pairs of consecutive tosses that come up heads? (For example, the sequence THHTHHHTHH has 4 pairs of consecutive HH’s.)
Solution:
The overall pairs in my throw is 9 times. For each pair, the expected HH is 1/4. So the overall pairs is 9*1/4 = 9/4

3

George has six ropes. He chooses two of the twelve loose ends at random (possibly from the same rope), and ties them together, leaving ten loose ends. He again chooses two loose ends at random and joins them, and so on, until there are no loose ends. Find, with proof, the expected value of the number of loops George ends up with.
Solution1: (recursive)
$E_n$ means start with n ropes, select one end, with 1/2n-1 you will form a circle or else remain the same
$$\begin{gathered} E_n=\frac{1}{2n-1}(E_{n-1}+1)+\frac{2n-2}{2n-1}{E}_{n-1} \\ {E}_n=E_{n-1}+\frac{1}{2n-1}{E}_1=1,E_6=\frac{1508}{3465} \end{gathered}$$
Solution 2:(directly)
Total number of combination begin with n:$f(n)=\frac{C_{2n}^2...C_2^2}{n!}$ which is $\frac{(2n)!}{2^{n}n!}$. Total number of comination to use n rope form a circle is $g(n)=(n-1)!2^{n-1}$. So the total number of circles in all combination is ${\sum }_{i=1}^6{C}_6^{i}g(i)f(6-i)$. Divide it by f(6) will be ok.

4

Fifteen freshmen are sitting in a circle around a table, but the course assistant (who remains standing) has made only six copies of today’s handout. No freshman should get more than one handout, and any freshman who does not get one should be able to read a neighbor’s. If the freshmen are distinguishable but the handouts are not, how many ways are there to distribute the six handouts subject to the above conditions?
Solution: Suppose that you are one of the freshmen,we may ask, given that you do get a handout, how many ways are there to distribute the rest? We need only multiply the answer to that question by 15/6 to answer the original question.(because there are 15 people and the situation can be repeat 6 times.
Going clockwise around the table from you, one might write down the sizes of the gaps between people with handouts. There are six such gaps, each of size 0–2, and the sum of their sizes must be 15 − 6 = 11. So the gap sizes are either 1, 1, 1, 2, 2, 2 in some order, or 0, 1, 2, 2, 2, 2 in some order. In the former case, 6! = 20 orders are possible; 3!3!
in the latter, 6! = 30 are. Altogether, then, there are 20 + 30 = 50 possibilities.
1!1!4!
Multiplying this by 15/6, or 5/2, gives 125