MAT 142 3.2 Fundamental Counting Principle
in Mathematics by Euler
Favorite
Add it to your favorites and revisit later
Instant Download
Previewing 0 of 1 total pages.
Regular Price: $7.14
Your Price: $5.00 (30% discount)
You Save: $2.14
Your Price: $5.00 (30% discount)
You Save: $2.14
Description
MAT 142 Problem set
Unit: Probability
Topic: The Fundamental Counting Principle
Directions: Solve the following problems. Please show your work and explain your reasoning.
- The Belching Dragon has a family style menu. The menu is a follows:
How many different meals can be made from this menu?
- Using the digits 0 9, find out how many 4 digit numbers can be configured based on the stated
conditions:
a. The number cannot start with zero and no digits can be repeated.
b. The number must begin and end with an odd digit.
c. The number must at least 5000 and be divisible by 10. (Repeated digits are okay)
d. The number must less than 3000 and must be even. No digits may be repeated in the
last 3 digits. (That is, 2,234 would be okay but 2,334 would not be okay)
Comments (0)
You must sign in to make a comment.
Rating:
Published On:
02/25/2013
Print Length:
1 page(s)
File Name:
3.2 Fundamental Counting Principle.pdf
File Size:
427.49 KB (0.43 MB)
Sold By:
Euler
Purchased:
2 times
Best Seller Ranking:
#2588