高二数学排列组合问题,求详解。

作者&投稿:罗绍 (联系方式在网页底部的电邮联系)
高二数学排列组合问题,求详解~

1. Let S(n,k) be the Stirling number of the second kind. There are 3! ways to permute the job positions. From defintion, the answer is 3!*S(6,3)=6*90=540.

2. To choose 3 numbers from 1,2,3,4,5,6,7 there are 10 ways:
135, 136, 137, 146, 147, 157, 246, 247, 257, 357.
Permuting the colors we get the answer 10*3!=60.

3. The answer is 84. Suppose 1,2,3,4,5,6 are the 6 positions. It is easy to list all disadjacent pairs of positions as follows:
13, 14, 15, 16, 24, 25, 26, 35, 36, 46. (1)
Again, it is easy to select a pair from the sequence (1) containing four distinct positions:
13 with 24, 25, 26, 46;
14 with 25, 26, 35, 36;
15 with 24, 26, 36, 46;
16 with 24, 25, 35;
24 with 35, 36;
25 with 36, 46;
26 with 35;
35 with 46. (2)
Counting them in (2), we get 4+4+4+3+2+2+1+1=21 pairs. For each pair, there are 2 ways to distribute the letters 1 and 2, and two ways to distribute 3 and 4. Hence the total number is
21*2*2=84.

4. I assume a mistake in the problem: the condition "any two digits have different parities" should be "any adjacent digits have different parities". Under this condition, the answer is 264.

First, by the above revised condition, either (put the letters 1,3,5,7 into the positions 1,3,5,7), or (put the letters 1,3,5,7 into the positions 2,4,6,8). It is clear that these two cases correspond to the same number of legal permutations. So we can focus on one of them, say, the first case.

Second, for any 1<=i<=8, let x_i be position of the letter i. Then the combination of (x_1,x_2) has the following 7 possibilities:
12, 32, 34, 54, 56, 76, 78. (1)
For each case, there are 3!^2=36 ways to put the letters 3,4,5,6,7,8 arbitrarily. So there are
7*36=252 (2)
ways in all.

Third, we need to find the ways among such that the letters 3 and 4 are adjacent. Suppose x_3 and x_4 are adjacent. We deal with each case in (1):
if (x_1,x_2)=(1,2), then (x_3,x_4) can be
34, 54, 56, 76, 78;
if (x_1,x_2)=(3,2), then (x_3,x_4) can be
54, 56, 76, 78;
...
if (x_1,x_2)=(7,8), then (x_3,x_4) can be
12, 32, 34, 54, 56.
In total, there are 5+4+4+4+4+4+5=30 ways of putting the letters 3 and 4 adjacently. For each of them, there are 2!^2=4 ways to put the letters 5,6,7,8. So there are
30*4=120 (3)
illegal ways in all.

Finally, by (2) and (3), we have 252-120=132 ways under the assumption that the letters 1,3,5,7 are put into the positions 1,3,5,7. Hence, the total number of legal arrangements is
132*2=264.

5. The answer is 1212. Suppose the positions to plant are respectively A,B,C,D,E,F in the clock-wise order. We write A=i to denote the plant i (1<=i<=4) is planted in the position A. Without loss of generality, we can suppose that A=1 and B=2.

If only 2 plants are used, then we have
N1=binomial(4,2)*2=12 (1)
legal ways in this case.

Suppose there are exactly 3 plants are used. Then there are 10 legal arrangements (C,D,E,F):
(1,2,1,3), (1,2,3,2), (1,3,1,2), (1,3,1,3), (1,3,2,3), (3,1,2,3), (3,1,3,2), (3,2,1,2), (3,2,1,3), (3,2,3,2).
So we have
N2:=binomial(4,3)*3!*10=240
legal ways in this case.

Suppose there are exactly 4 plants are used. It is clear that C=1 or C=3 or C=4.
If C=1 and D=2, then (E,F) is either 34 or 43. We have N3=2 ways.
If C=1 and D=3, then (E,F) is either 14, or 24 or 42 or 43. We have N4=4 ways.
If C=1 and D=4, by the symmetry of 3 and 4, we have N5=N4=4 ways.
If C=3 and D=1, then (E,F) is either 24 or 34 or 42 or 43. We have N6=4 ways.
If C=3 and D=2, then (E,F) is either 14 or 34 or 42 or 43. We have N7=4 ways.
If C=3 and D=4, then (E,F) is either 12 or 13 or 14 or 23 or 24 or 32 or 34. We have N8=7 ways.
If C=4, by symmetry of 3 and 4, we have N9=N6+N7+N8=4+4+7=15 ways.

To sum up, we have N1+N2+4!*(N3+...+N9)=12+240+4!*(2+4+4+15*2)=1212 ways in total.


【俊狼猎英】团队为您解答~
1)30030=2*3*5*7*11*13,要求是偶数就是2的幂指数必然为1,而3,5,7,9,11,13的幂指数为0或1,因此共有2^6=64个偶因数
2)异面直线就是不平行也不交叉的直线,先对每一条直线求出对数,总数除以2即可
共有三类直线:1棱2面对角线3体对角线
1每条棱有不共面棱4条,面对角线6条,体对角线2条,共12*12=144对
2每条面对角线有不共面棱6条,面对角线5条,体对角线2条,共12*13=156对
3每条体对角线有不共面棱6条,面对角线6条,体对角线0条,共12*12=144对
因此异面直线共222对
3)显然交点最多的情况下任意两条交点在园内的弦交点都不相同,而每个园内交点和一个圆内接四边形一一对应,因此共C(10,4)=210个

相关视频

高二数学排列组合问题求助在线等急!!!
解答:按照要求,需要有两名职工值班2天,1名职工值班一天 相当于将3名工人全排列,然后再选两名工人值两天班即可 共有A(3,3)*C(3,2)=3*2*2 *(3*2)\/(1*2)=18种。数理答疑团为您解答,希望对你有所帮助。甲安排一天,则乙、丙安排两天,甲只能周一、三、五,3种[C(3,1)];而每种时,乙、丙有2种[A(2,2)]情况。即:

高二数学排列组合问题,有解答求解释
首先是五个里面选三个,对吧?那么就是c53,但是这三张可以不同顺序,所以要全排列,所以是a53,又因为每张牌都有正反面所以有c21*c21*c21.所以总的就是a53*c21*c21*c21=480.这是总的三位数的个数.然后再把零的去掉,那么就是零已经确定是第一个数了,所以又四张卡里选两个全排列,然后是每张...

高二数学 排列组合A C怎么算?
\/ [m!(n-m)!]。这里的“!”表示阶乘,即n! = n × (n-1) × ... × 1。以C(6,2)为例,首先计算A(6,2) = 6 × 5 = 30,然后除以A(2,2) = 2 × 1 = 2,即C(6,2) = 30 \/ 2 = 15。排列和组合在解决实际问题时有着广泛的应用。例如,在比赛的安排中,如果要从6...

高中数学排列组合问题什么时候用排列什么时候用组合,简单易懂些_百度...
排列与组合一个最大的区别就是有没有顺序。以一个吃水果为例 假设有4种水果:苹果,香蕉,西瓜,橘子。比如你每顿饭可以选2种水果,你有多少种选发了,那就要用组合,C6选2=15。比如(苹果,香蕉)=(香蕉,苹果),具体的就不全部列举。但是,每顿饭可以种2种水果,先吃什么,后吃什么,有...