Name: _______________

Section: __

Probability Homework
1

( )

( )

( )

( )

( )

( )

This is both a probability problem and a combination problem. The Probability of getting HHTTT is: . This is the probability of getting that exact arrangement in that order. Hoever, we could also get HTTTH- this one also has a probability of . The question then is: how many unique combinations can we have of 3 heads and 2 tails. To find out how many unieq combinations we have, we must figure out how many ways we can arrange these 5 objects [also known as the number of permutations]. Then, we need to divide out repeated patterns. First, there are 5! ways to arrange these choices. However, the 3 heads could be re-arranged 6 ways, and still give us the same pattern. Consider . Thats the same pattern as . In fact we can rearrange three things 3! Ways. So, we need to divide our 5! By the way the heads can repeat. This gives us . But were not done. We have two tails. Same problem as before, only now there are 2 ways that the tails could be arranged that look the same, such as and . We need to divide out those repeaters as well. This gives us a final expression of: . Since they each have same probability of occurring, we get

5
C

a) Since there are only 7 dwarves, the probability that Bashful gets kissed first would be b) Now we must consider how many possible outcomes there are. Notice if Sneezy is kissed first on Monday, there are still 7 possibilities for Tuesday [each arrow is a possible outcome]. If Snow chose Grumpy on Monday, there would be 7 different possibilities on Tuesday. In fact, no matter which dwarf we look at first, each one will lead to seven possible outcomes on Tuesday. Since there are Seven possibilities on Monday, and each of these possibilities leads to 7 possibilities, that means there are 49 possible outcomes. How many of these outcome involve Bashful getting kissed first on both days? Only 1 outcome has Bashful getting kissed both days, meaning our probability is actually c) We can use the same process to figure out ( ) ( ) On Monday, there are 6 events that do not involve Bashful being kissed first. Same thing on Tuesdaytherefore we get d) This can be tricky. The hard way would be to figure out each probability: ( ) ( ) ( ) Thats a lot of work, but would work. However, there 1

is an easier way. Consider this. The alternative to being kissed first at least once would be not getting kissed first ever. And that makes our problem much easier, because these probabilities are mutually exclusive. Either he did get kissed first at some point, or he never did. That means the probability of ) ( ) these two events occurring is ( . And to find the probability that he never gets kissed, we can refer back to part c). Each day will be . Since we are doing it for all 5 diays, that would be ( ) . We can now solve for ( ( ( ( ( e) ) ) ) ) ( ( ) ( ) ) ) ( )

. Theres one less dwarf to consider after the first one is kissed. That leaves only 6 possible outcomes, one of which is Grumpy.

f) g) . Remember: probability is . We have 2 desired outcomes at first,

either Bashful or Grumpy getting kissed first. Then, assuming one of them is picked, there is one less desired outcome [numerator], and there is one less total possible outcome [denominator]

6
C

a)

. The events here are playing cards. The desired

event is an Ace of Spades. There are 52 possible playing cards to draw from. There is only 1 Ace of ) Spades: (

b) c) This problem has been considered ambiguous, meaning there are multiple interpretations of its meaning. If we take this to mean how many unique ways can we draw 2 cards out of a 52 card eck, then this become a combination problem like #4. In this case, the possible permutations would be 52!, then, we divide out the repeats. We have taken the deck, and partitioned it into 50 other cards whose order we dont care about, and 2 cards. The possible way we can rearrange 50 cards is 50!, which we will divide out of 52!, along with the 2 cards having 2! Possible ways of rearranging them. So, we end up with: possible ways to draw two cards from a deck. d) e) f) Same as part c above. g) 7. Find the probability of each outcome if you randomly select a coin from a jar containing 30 pennies, 20 nickels, 30 dimes and 20 quarters. a. Selecting a Quarter
( ( ( ( ( ( ) ) ) ) ) )

b. Selecting a Dime c. Not selecting a Nickel d. Selecting a Penny or a Dime e. Not selecting a Penny f. Selecting a Penny or a Quarter

8. Write a paragraph describing how probabilities are used in real life. Give 4 or more specific examples.

9. In how many different ways can the letters of the work HOUSE be arranged?
We have 5 unique objects here [no letter is a repeat], so this becomes a permutation problem.