无忧得胜-网上国际课程 (5edu.win)

 找回密码
 立即注册

 

      

上传图片附件

未使用图片

小贴士: 允许的图片文件格式为: gif, jpg, jpeg, png, webp,上传完成后会在上方生成预览,用鼠标连续双击缩略图,或拖动缩略图,该图片就被绑定至本题,显示在题目下方

本次作答已使用

小贴士: 此栏目显示的是当前作答使用的所有图片,绑定到某一题目的图片同时会显示在该题目下方; 删除使用的图片会将其转移到<未使用图片>类别


习题练习:Counting Principles 

 作者: admin 发布日期: 2024-06-02 22:24   总分: 16分  得分: _____________

答题人: 游客未登录  开始时间: 24年06月02日 22:24  切换到: 整卷模式

标记此题
1#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  Find the number of wxi dk(7 77ympolng:p3ays in which twelve different baseball cards can be given to Emily, Harry, John and Olivia, if Emily is to receive 5 cards, Harry is to receive 3 cards, John is to receive 3 xpgi7dkm7y :np7o 3l(cards and Olivia is to receive 1 card.   

参考答案:     查看本题详细解析

标记此题
2#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  Tyler needs to decide the order in which to schedule 11 exams for his s+co)), tgnowfchool. Two of these exams are Chemistry ( 1 SL and 1 HL). Find the number of different ways Ty)owt n,og +fc)ler can schedule the 11 exams given that the two Chemistry subjects must not be consecutive.$\approx a \times 10^{b}$ a =    b =   

参考答案:     查看本题详细解析

标记此题
3#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  A school basketball team of 5 students is selected fromsam2g txne /6e0 ebm..iz).cqxt 5a* s 8 boys and 4 girls.
1. Determine how many possible teams can be chosen.   
2. Determine how many teams can be formed consisting of 3 boys and 2 girls?   
3. Determine how many teams can be formed consisting of at most 3 girls?   

参考答案:     查看本题详细解析

标记此题
4#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  A police department has 4 male and 7 female officers. A special group of 5 of0o x;y2)on :j366nn(blxnh.snjjklk ficers is tn:6 sk n6x jn. ;)kbonn0(jljl2oh yx3o be assembled for an undercover operation.
1. Determine how many possible groups can be chosen.   
2. Determine how many groups can be formed consisting of 2 males and 3 females.   
3. Determine how many groups can be formed consisting of at least one male.   

参考答案:     查看本题详细解析

标记此题
5#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  In an art museum, there are 8 different paintin9ug,q u4 bgy0 l(rinq2z8xl d7(5oyo qgs by Picasso, 5 different paintings by Van Gogh, and 3 different paintings by Rembrandt. The curator of the museum wants to hold an exhibition9, n 4goq u8robd0(qy7lx g5(2iqulzy in a hall that can only display a maximum of 7 paintings at a time.
The curator wants to include at least two paintings from each artist in the exhibition.
1. Given that 7 paintings will be displayed, determine how many ways they can be selected.   
2. Find the probability that more Rembrandt paintings will be selected than Picasso paintings or Van Gogh paintings.   

参考答案:     查看本题详细解析

标记此题
6#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  Peter needs to decide the order in which f8ao akfe zm48c*i; i,to schedule 14 exams for his school. Two of these exams are Chemistry ( 1 SL and 1 HL). Find the number of different ways Peter can schedule the 14 exams given that the two Chemistry subjak;4eifm,*c az8 if8oects must not be consecutive.$\approx a \times 10^{b}$ a =    b =   

参考答案:     查看本题详细解析

标记此题
7#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  Ten students are to be arranged in a new chemistry lab. The chemistry lab is sek j6sp6vlhvt l81;a(v t out in two (;lhva l686stjkpv v1rows of five desks as shown in the following diagram.



1. Find the number of ways the ten students may be arranged in the lab.

Two of the students, Hugo and Leo, were noticed to talk to each other during previous lab sessions.   
2. Find the number of ways the students may be arranged if Hugo and Leo must sit so that one is directly behind the other. For example, Dest 1 and Desk 6 .   
3. Find the number of ways the students may be arranged if Hugo and Leo must not sit next to each other in the same row.   

参考答案:     查看本题详细解析

标记此题
8#
 
问答题 ( 1.0 分) 切至整卷模式 搜藏此题  
An arts and crafts store is offering a special pack-b8j q51lj rqiage on personalized keychains. Custo5jql8ibj - qr1mers can choose to personalize their keychains with up to 3 different charms from a selection of 6 different types of charms.
Determine how many ways a customer can personalize a keychain if
1. The order is important.
2. The order is not important.
参考答案:     查看本题详细解析

标记此题
9#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  A professor and five of his students attend a t vgnlvcb-;b1 0alk given in a lecture series. They havvb 0b;1lncvg- e a row of 8 seats to themselves.
Find the number of ways the professor and his students can sit if
1. the professor and his students sit together.   
2. the students decide to sit at least one seat apart from their professor.   

参考答案:     查看本题详细解析

标记此题
10#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  Julie works at a book store and has nine books to display on t(krp 537,7owwxbdgq mka n+sygq 2,4hhe main shelf of the store. Four of the books are non-fiction and five are fiction. Each book is different. Determine the number of poa4(qk mgwxo7gb 37khp 5r,,ds2 +nqywssible ways Julie can line up the nine books on the main shelf, given that
1. the non-fiction books should stand together;   
2. the non-fiction books should stand together on either end;   
3. the non-fiction books should stand together and do not stand on either end.   

参考答案:     查看本题详细解析

标记此题
11#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  Sophia and Zoe compete in a freestyle swimming race where there+c *g t5o8felfc+ 2zfj are no tied finishes and there is a total of 10 competitors. 2zl5f f8ce*++jc otf gFind the total number of possible ways in which the ten swimmers can finish if Zoe finishes
1. in the position immediately after Sophia;   
2. in any position after Sophia.   

参考答案:     查看本题详细解析

标记此题
12#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  There are 11 players on a football team who arek e*:y 6xak1xo cz4xw5 asked to line up in one straight line for a team photo. Three of the team members named Adam, Brad and Chris refuse to stand next to each other. There is no restriction on the order in whix1xkw6ocyz *ek5: x 4ach the other team members position themselves.
Find the number of different orders in which the 11 team members can be positioned for the photo.   

参考答案:     查看本题详细解析

标记此题
13#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  There are six office cubicles arranged in a grid with g1ac a 0(m: 74dd +kzksh,hqkdtwo rows and three columns as shown in the following diagram. Aria, Bella, Charlotte, Danna, and Emma are to be stationed inside the cubicles to work on variousdm,k hzaq1(: 0c gk+s dak4hd7 company projects.
Find the number of ways of placing the team members in the cubicles in each of the following cases.
1. Each cubicle is large enough to contain the five team members, but Danna and Emma must not be placed in the same cubicle.   
2. Each cubicle may only contain one team member. But Aria and Bella must not be placed in cubicles which share a boundary, as they tend to get distracted by each other.   

参考答案:     查看本题详细解析

标记此题
14#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  The barcode strings of a new proild x2kbe5+1w8roua1po a ;;aduct are created from four letters $ \mathrm{A}$, $\mathrm{B}$, $\mathrm{C}$, $\mathrm{D}$ and ten digits $0,1,2, \ldots, 9$ . No three of the letters may be written consecutively in a barcode string. There is no restriction on the order in which the numbers can be written. Find the number of different barcode strings that can be created.$\approx a \times 10^{b}$ a =    b =   

参考答案:     查看本题详细解析

标记此题
15#
 
填空题 ( 1.0 分) 切至整卷模式 搜藏此题  
  Sophie and Ella play a game. They each have five cards showing rom. zp5ni.e*ijdv ou+8han numerals I, V, X, L, C. Sophie lays her cards face up on the table in order I, V, X, L, C as shown in the following vij..8u d5zopehi* +n diagram.


Ella shuffles her cards and lays them face down on the table. She then turns them over one by one to see if her card matches with Sophie's 4 card directly above. Sophie wins if no matches occur; otherwise Ella wins.
1. Show that the probability that Sophie wins the game is $\frac{11}{30}$ .

Sophie and Ella repeat their game so that they play a total of 90 times. Let the discrete random variable X represent the number of times Sophie wins.   
2. Determine:
1. the mean of X ;   
2. the variance of X .   

参考答案:     查看本题详细解析

标记此题
16#
 
问答题 ( 1.0 分) 切至整卷模式 搜藏此题  
Jack and John have decided to play a game. They will be rolling xs xse* g(go:5a die seven times. One roll of a die is considered as one round of the game. On each round, John agrees to pay Jack 4 dollars if 1 or 2 is rolled, Jack agrees tog :e*(xgsxs5 o pay John 2 dollars if 3,4,5 or 6 is rolled, and who is paid wins the round. In the end, who earns money wins the game.
1. Show that the probability that Jack wins exactly two rounds is $\frac{224}{729}$ .
2. 1. Explain why the total number of outcomes for the results of the seven rounds is 128 .
2. Expand $(1+y)^{7}$ and choose a suitable value of y to prove that

$128=\binom{7}{0}+\binom{7}{1}+\binom{7}{2}+\binom{7}{3}+\binom{7}{4}+\binom{7}{5}+\binom{7}{6}+\binom{7}{7}$ .

3. Give a meaning of the equality above in the context of the seven rounds.
3. 1. Find the expected amount of money earned by each player in the game.
2. Who is expected to win the game?
3. Is this game fair? Justify your answer.
4. Jack and John have decided to play the game again.
1. Find an expression for the probability that John wins five rounds on the first game and two rounds on the second game. Give your answer in the form

$\binom{7}{r}^{2}\left[\frac{1}{3}\right]^{s}\left[\frac{2}{3}\right]^{t}$

where the values of r, s and t are to be found.
2. Use your answer to (d) (i) and seven similar expressions to write down the probability that John wins a total of seven rounds over two games as the sum of eight probabilities.
3. Hence prove that

$\binom{14}{7}=\sum_{k=0}^{7}\binom{7}{k}^{2}$

5. Now Jack and John roll a die 12 times. Let A denote the number of rounds Jack wins. The expected value of A can be written as

$\mathrm{E}[A]=\sum_{r=0}^{12} r\binom{12}{r}\left[\frac{a^{12-r}}{b^{12}}\right]$

1. Find the value of a and b .
2. Differentiate the expansion of $(1+y)^{12}$ to prove that the expected number of rolls Jack wins is 4 .

本题所包含的其它图片:

参考答案:     查看本题详细解析

总分:16分 及格:9.6分 时间:不限时
未答题: 已答题:0 答错题:
当前第 题,此次习题练习共有 16 道题

浏览记录|手机版试卷|使用帮助|手机版|无忧得胜-网上国际课程 (https://5edu.win)

GMT+8, 2026-1-10 17:43 , Processed in 0.122048 second(s), 62 queries , Redis On.