Chap2CombinatorialMethodsGhahramani3rdedition_第1頁(yè)
Chap2CombinatorialMethodsGhahramani3rdedition_第2頁(yè)
Chap2CombinatorialMethodsGhahramani3rdedition_第3頁(yè)
Chap2CombinatorialMethodsGhahramani3rdedition_第4頁(yè)
Chap2CombinatorialMethodsGhahramani3rdedition_第5頁(yè)
已閱讀5頁(yè),還剩11頁(yè)未讀, 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡(jiǎn)介

1、Chap 2 Combinatorial MethodsGhahramani 3rd edition1 Outline2.1 Introduction2.2 Counting principle2.3 Permutations2.4 Combinations2.5 Stirlings formula 2.1 IntroductionIf the sample space is finite and furthermore sample points are all equally likely, then P(A)=N(A)/N(S) So we study combinatorial ana

2、lysis here, which deals with methods of counting. 2.2 Counting principleEx 2.1 How many outcomes are there if we throw 5 dice?Ex 2.2 In tossing 4 fair dice, P(at least one 3 among these 4 dice)=?Ex 2.3 Virginia wants to give her son, Brian, 14 different baseball cards within a 7-day period. If Virgi

3、nia gives Brian cards no more than once a day, in how many way can this be done?Ex 2.6 (Standard Birthday Problem) P(at least two among n people have the same Bday)=?Counting principleThm 2.3 A set with n elements has 2n subsets.Ex 2.9 Mark has $4. He decides to bet $1 on the flip of a fair coin 4 t

4、imes. What is the probability that (a) he breaks even; (b) he wins money?(use tree diagram) 2.3 PermutationsEx 2.10 3 people, Brown, Smith, and Jones, must be scheduled for job interviews. In how many different orders can this be done?Ex 2.11 2 anthropology, 4 computer science, 3 statistics, 3 biolo

5、gy, and 5 music books are put on a bookshelf with a random arrangement. What is the probability that the books of the same subject are together?PermutationsEx 2.12 If 5 boys and 5 girls sit in a row in a random order, P(no two children of the same sex sit together)=?Thm 2.4 The number of distinguish

6、able permutations of n objects of k different types, where n1 are alike, n2 are alike, , nk are alike and n=n1+n2+nk isPermutationsEx 2.13 How many different 10-letter codes can be made using 3 as, 4 bs, and 3 cs?Ex 2.14 In how many ways can we paint 11 offices so that 4 of them will be painted gree

7、n, 3 yellow, 2 white, and the remaining 2 pink?Ex 2.15 A fair coin is flipped 10 times. P(exactly 3 heads)=?2.4 CombinationsEx 2.16 In how many ways can 2 math and 3 biology books be selected from 8 math and 6 biology books?Ex 2.17 45 instructors were selected randomly to ask whether they are happy

8、with their teaching loads. The response of 32 were negative. If Drs. Smith, Brown, and Jones were among those questioned. P(all 3 gave negative responses)=?CombinationsEx 2.18 In a small town, 11 of the 25 schoolteachers are against abortion, 8 are for abortion, and the rest are indifferent. A rando

9、m sample of 5 schoolteachers is selected for an interview. (a)P(all 5 are for abortion)=? (b)P(all 5 have the same opinion)=?Ex 2.19 In Marylands lottery, player pick 6 integers between 1 and 49, order of selection being irrelevant. P(grand prize)=? P(2nd prize)=? P(3rd prize)=?CombinationsEx 2.20 7

10、 cards are drawn from 52 without replacement. P(at least one of the cards is a king)=?Ex 2.21 5 cards are drawn from 52. P(full house)=?Ex 2.24 A professor wrote n letters and sealed them in envelopes. P(at least one letter was addressed correctly)=? Hint: Let Ei be the event that ith letter is addr

11、essed correctly. Compute P(E1UUEn) by inclusion-exclusion principle.CombinationsThm 2.5 (Binomial expansion)Ex 2.25 What is the coefficient of x2y3 in the expansion of (2x+3y)5?Ex 2.26 Evaluate the sumCombinationsEx 2.27 Evaluate the sumEx 2.28 Prove thatCombinationsEx 2.29 Prove the inclusion-exclusion principle.Ex 2.30 Distribute n distinguishable balls into k distinguishable cells so that n1 balls are distributed into the firs

溫馨提示

  • 1. 本站所有資源如無(wú)特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

評(píng)論

0/150

提交評(píng)論