19 basics of counting

Information about 19 basics of counting

Published on February 5, 2008

Author: Rinald

Source: authorstream.com

Content

Basics of Counting:  Basics of Counting CS/APMA 202 Rosen section 4.1 Aaron Bloomfield The product rule:  The product rule If there are n1 ways to do task 1, and n2 ways to do task 2 Then there are n1n2 ways to do both tasks in sequence This applies when doing the “procedure” is made up of separate tasks We must make one choice AND a second choice Product rule example:  Product rule example Rosen, section 4.1, question 1 (a) There are 18 math majors and 325 CS majors How many ways are there to pick one math major and one CS major? Total is 18 * 325 = 5850 Product rule example:  Product rule example Rosen, section 4.1, question 22 (a) and (b) How many strings of 4 decimal digits… Do not contain the same digit twice? We want to chose a digit, then another that is not the same, then another… First digit: 10 possibilities Second digit: 9 possibilities (all but first digit) Third digit: 8 possibilities Fourth digit: 7 possibilities Total = 10*9*8*7 = 5040 End with an even digit? First three digits have 10 possibilities Last digit has 5 possibilities Total = 10*10*10*5 = 5000 The sum rule:  The sum rule If there are n1 ways to do task 1, and n2 ways to do task 2 If these tasks can be done at the same time, then… Then there are n1+n2 ways to do one of the two tasks We must make one choice OR a second choice Sum rule example:  Sum rule example Rosen, section 4.1, question 1 (b) There are 18 math majors and 325 CS majors How many ways are there to pick one math major or one CS major? Total is 18 + 325 = 343 Sum rule example:  Sum rule example Rosen, section 4.1, question 22 (c) How many strings of 4 decimal digits… Have exactly three digits that are 9s? The string can have: The non-9 as the first digit OR the non-9 as the second digit OR the non-9 as the third digit OR the non-9 as the fourth digit Thus, we use the sum rule For each of those cases, there are 9 possibilities for the non-9 digit (any number other than 9) Thus, the answer is 9+9+9+9 = 36 Quick survey:  Quick survey I’m feeling good with the sum rule and the product rule… Very well With some review, I’ll be good Not really Not at all More complex counting problems:  More complex counting problems We combining the product rule and the sum rule Thus we can solve more interesting and complex problems Wedding pictures example:  Wedding pictures example Rosen, section 4.1, question 38 Consider a wedding picture of 6 people There are 10 people, including the bride and groom How many possibilities are there if the bride must be in the picture Product rule: place the bride AND then place the rest of the party First place the bride She can be in one of 6 positions Next, place the other five people via the product rule There are 9 people to choose for the second person, 8 for the third, etc. Total = 9*8*7*6*5 = 15120 Product rule yields 6 * 15120 = 90,720 possibilities Wedding pictures example:  Wedding pictures example Rosen, section 4.1, question 38 Consider a wedding picture of 6 people There are 10 people, including the bride and groom How many possibilities are there if the bride and groom must both be in the picture Product rule: place the bride/groom AND then place the rest of the party First place the bride and groom She can be in one of 6 positions He can be in one 5 remaining positions Total of 30 possibilities Next, place the other four people via the product rule There are 8 people to choose for the third person, 7 for the fourth, etc. Total = 8*7*6*5 = 1680 Product rule yields 30 * 1680 = 50,400 possibilities Wedding pictures example:  Wedding pictures example Rosen, section 4.1, question 38 Consider a wedding picture of 6 people There are 10 people, including the bride and groom How many possibilities are there if only one of the bride and groom are in the picture Sum rule: place only the bride Product rule: place the bride AND then place the rest of the party First place the bride She can be in one of 6 positions Next, place the other five people via the product rule There are 8 people to choose for the second person, 7 for the third, etc. We can’t choose the groom! Total = 8*7*6*5*4 = 6720 Product rule yields 6 * 6720 = 40,320 possibilities OR place only the groom Same possibilities as for bride: 40,320 Sum rule yields 40,320 + 40,320 = 80,640 possibilities Wedding pictures example:  Wedding pictures example Rosen, section 4.1, question 38 Consider a wedding picture of 6 people There are 10 people, including the bride and groom Alternative means to get the answer How many possibilities are there if only one of the bride and groom are in the picture Total ways to place the bride (with or without groom): 90,720 From part (a) Total ways for both the bride and groom: 50,400 From part (b) Total ways to place ONLY the bride: 90,720 – 50,400 = 40,320 Same number for the groom Total = 40,320 + 40,320 = 80,640 Quick survey:  Quick survey I’m feeling good with these sum and product rule examples… Very well With some review, I’ll be good Not really Not at all End of lecture on 29 March 2005:  End of lecture on 29 March 2005 The inclusion-exclusion principle:  The inclusion-exclusion principle When counting the possibilities, we can’t include a given outcome more than once! |A1U A2| = |A1| + |A2| - |A1∩ A2| Let A1 have 5 elements, A2 have 3 elements, and 1 element be both in A1 and A2 Total in the union is 5+3-1 = 7, not 8 Inclusion-exclusion example:  Inclusion-exclusion example Rosen, section 4.1, example 16 How may bit strings of length eight start with 1 or end with 00? Count bit strings that start with 1 Rest of bits can be anything: 27 = 128 This is |A1| Count bit strings that end with 00 Rest of bits can be anything: 26 = 64 This is |A2| Count bit strings that both start with 1 and end with 00 Rest of the bits can be anything: 25 = 32 This is This is |A1∩ A2| Use formula |A1U A2| = |A1| + |A2| - |A1∩ A2| Total is 128 + 64 – 32 = 160 Bit string possibilities:  Bit string possibilities Rosen, section 4.1, question 42 How many bit strings of length 10 contain either 5 consecutive 0s or 5 consecutive 1s? Bit string possibilities:  Bit string possibilities Consider 5 consecutive 0s first Sum rule: the 5 consecutive 0’s can start at position 1, 2, 3, 4, 5, or 6 Starting at position 1 Remaining 5 bits can be anything: 25 = 32 Starting at position 2 First bit must be a 1 Otherwise, we are including possibilities from the previous case! Remaining bits can be anything: 24 = 16 Starting at position 3 Second bit must be a 1 (same reason as above) First bit and last 3 bits can be anything: 24 = 16 Starting at positions 4 and 5 and 6 Same as starting at positions 2 or 3: 16 each Total = 32 + 16 + 16 + 16 + 16 + 16 = 112 The 5 consecutive 1’s follow the same pattern, and have 112 possibilities There are two cases counted twice (that we thus need to exclude): 0000011111 and 1111100000 Total = 112 + 112 – 2 = 222 Tree diagrams:  Tree diagrams We can use tree diagrams to enumerate the possible choices Once the tree is laid out, the result is the number of (valid) leaves Tree diagrams example:  Tree diagrams example Rosen, section 4.1, question 48 Use a tree diagram to find the number of bit strings of length four with no three consecutive 0s An example closer to home…:  An example closer to home… How many ways can the Cavs finish the season 9 and 2? (7,1) Quick survey:  Quick survey I felt I understood the material in this slide set… Very well With some review, I’ll be good Not really Not at all Quick survey:  Quick survey The pace of the lecture for this slide set was… Fast About right A little slow Too slow Quick survey:  Quick survey How interesting was the material in this slide set? Be honest! Wow! That was SOOOOOO cool! Somewhat interesting Rather borting Zzzzzzzzzzz Beware!!!:  Beware!!!

Related presentations


Other presentations created by Rinald

EarlyCivilizations
13. 02. 2008
0 views

EarlyCivilizations

Fungal Lecture3
08. 01. 2008
0 views

Fungal Lecture3

sbmr6
14. 01. 2008
0 views

sbmr6

marine mammals rev
15. 01. 2008
0 views

marine mammals rev

trickster
17. 01. 2008
0 views

trickster

Lead Without a Rope HDP 2004
17. 01. 2008
0 views

Lead Without a Rope HDP 2004

MLN Kickoff Presentation revised
18. 01. 2008
0 views

MLN Kickoff Presentation revised

swri jc 030205bb
19. 01. 2008
0 views

swri jc 030205bb

Indy2007 Yunlong
21. 01. 2008
0 views

Indy2007 Yunlong

CDM 2004
23. 01. 2008
0 views

CDM 2004

EthnoForum05
04. 02. 2008
0 views

EthnoForum05

LCA Mari Nissinen
10. 01. 2008
0 views

LCA Mari Nissinen

tsunamidisaster
14. 02. 2008
0 views

tsunamidisaster

SharePoint2003
20. 02. 2008
0 views

SharePoint2003

004 Jan15 ITS Paul Boltwood
10. 01. 2008
0 views

004 Jan15 ITS Paul Boltwood

AbePP07 08
10. 03. 2008
0 views

AbePP07 08

pratt iree 11 04
09. 01. 2008
0 views

pratt iree 11 04

FMDHolland2
03. 04. 2008
0 views

FMDHolland2

quality2
22. 01. 2008
0 views

quality2

2005 Judo Vision
14. 04. 2008
0 views

2005 Judo Vision

Olympism 071107 print LAISIR
17. 04. 2008
0 views

Olympism 071107 print LAISIR

ntlcr0607b v061015
23. 04. 2008
0 views

ntlcr0607b v061015

prospects for the thames gateway
24. 04. 2008
0 views

prospects for the thames gateway

iau application 2006 08 01
02. 05. 2008
0 views

iau application 2006 08 01

SRTSIntroductionWhyA ndHow
02. 05. 2008
0 views

SRTSIntroductionWhyA ndHow

IntruderTexasAphidda ta
24. 01. 2008
0 views

IntruderTexasAphidda ta

PortraitsinArt
26. 02. 2008
0 views

PortraitsinArt

ES
20. 02. 2008
0 views

ES

AerospaceMedicineFli ghtSurgery
04. 02. 2008
0 views

AerospaceMedicineFli ghtSurgery

BigelowPresentation
09. 01. 2008
0 views

BigelowPresentation

rahab
29. 01. 2008
0 views

rahab