DOC PREVIEW
UIUC STAT 400 - 400Ex1_2

This preview shows page 1 out of 4 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 4 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 4 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

STAT 400 Lecture AL1 Examples for 1.2 Spring 2015 Dalpiaz Multiplication Principle ( Fundamental Rule of Counting ): If there are n events and event i can occur in N i possible ways, then the number of ways in which the sequence of n events may occur is N 1 ⋅ N 2 ⋅ ... ⋅ N n 1. Manager of a radio station decided that every day the broadcast will start with one of the 9 Beethoven Symphonies, followed by one of Mozart's 27 Piano Concertos, followed by one of Schubert’s 15 String Quartets. Approximately how many years can the station do that without repeating the program? 2. In how many orders can the names of 5 candidates for the same office be listed on a ballot? n ! = 1 ⋅ 2 ⋅ ... ⋅ ( n – 1 ) ⋅ n n ! = n ⋅ ( n – 1 ) ⋅ ... ⋅ 2 ⋅ 1 0 ! = 1 3. How many ways are there of scrambling the letters of the word SCRAMBLE ?4. Eight horses are entered in a race in which bets are placed on which horse will win, place, and show (that is, finish first, second and third). Suppose that the race is run and there are no ties. In how many ways can the win, place, and show be taken? Permutations are the possible ordered selections of r objects out of a total of n objects. The number of permutations of n objects taken r at a time is n P r = ()! ! rnn− 5. At Momma Leona’s Pizza you can get a pizza with or without each of eight different toppings. How many different three-topping pizzas can you get at Momma Leona’s Pizza if each topping can be put on a pizza at most once? (The order in which the toppings toppings are selected does not matter.) Combinations are the possible selections of r items from a group of n items regardless of the order of selection. The number of combinations of n objects taken r at a time is n C r = ( )! ! ! rnrnrn−=⋅order of the selection is important order of the selection is not important repetitions allowed (w/ replacement) n r n + r – 1 C r repetitions not allowed (w/o replacement) n P r = ( )! ! rnn− n C r = ()! ! ! rnrn−⋅ 6. The Baskin-Robbins Ice Cream Stores have 31 flavors of ice cream. a) How many different 3-scoop ice cream cones are possible if you are allowed to repeat flavors and want the scoops put on the cone in a particular order? b) How many different 3-scoop ice cream cones are possible if each scoop is a different flavor and you want the scoops put on the cone in a particular order? c) How many different 3-scoop cones are possible if each scoop is a different flavor and you don’t care about their order on the cone? d) How many different 3-scoop ice cream cones are possible if you are allowed to repeat flavors, but the order in which the scoops are placed into the cone is not important?7. To play Michigan Lotto, a person must pick 6 numbers from 49 numbers. a) If the player matches all 6 numbers (6 of 6) drawn, he/she wins the grand prize jackpot. Find the probability of winning the jackpot. b) Find the probability of guessing correctly 4 out of 6 numbers. 8. How many ways are there of scrambling the letters of the word BANANA ? 9. A student bookstore has 18 STAT 400 textbooks: 9 are new, 6 are used, and 3 are abused. a) How many ways are there to arrange the textbooks on the shelf? b) Eight students come to the store to buy a STAT 400 textbook. Suppose that the purchased textbooks are selected at random. What is the probability that 4 of the students would get a new book, 3 would get a used one, and 1 student would get an abused


View Full Document

UIUC STAT 400 - 400Ex1_2

Documents in this Course
Variance

Variance

11 pages

Midterm

Midterm

8 pages

Lecture 1

Lecture 1

17 pages

chapter 2

chapter 2

43 pages

chapter 1

chapter 1

45 pages

400Hw01

400Hw01

3 pages

Load more
Download 400Ex1_2
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view 400Ex1_2 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view 400Ex1_2 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?