Problem 3 : Souvenir Key-chain Bins For each of these problems, write down the permutation/combination expression and then sim- plify to a final number. Alice (she/her) and Bob (he/him) are going souvenir hunting during Spring Break. They come across a store that sells all sorts of key-chains. i. If they buy 75 key-chains, and have six bags to store the key-chains, how many different ways can the key-chains be assigned to the bags? ii. Assume that they pick 19 "Sunny Miami" key-chains and only these 19 key-chains. Both Alice and Bob really like this key-chain, so they want each of the six bags to have at least two of them. How many different ways can the "Sunny Miami" key chains be assigned to the bags? iii. Assume they buy 32 “Ft. Lauderdale" key chains and want to distribute them in six bags, one for each friend. They want to make sure everyone has at least 3 key-chains, but no more than 9 key-chains. How many ways can they assign the key chains to the bags given these restrictions?

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
100%
plz solve it within 30-40 mins I'll give upvote
Problem 3
: Souvenir Key-chain Bins
For each of these problems, write down the permutation/combination expression and then sim-
plify to a final number.
Alice (she/her) and Bob (he/him) are going souvenir hunting during Spring Break. They come
across a store that sells all sorts of key-chains.
i. If they buy 75 key-chains, and have six bags to store the key-chains, how many different ways
can the key-chains be assigned to the bags?
ii. Assume that they pick 19 "Sunny Miami" key-chains and only these 19 key-chains. Both
Alice and Bob really like this key-chain, so they want each of the six bags to have at least
two of them. How many different ways can the "Sunny Miami" key chains be assigned to the
bags?
iii. Assume they buy 32 “Ft. Lauderdale" key chains and want to distribute them in six bags,
one for each friend. They want to make sure everyone has at least 3 key-chains, but no more
than 9 key-chains. How many ways can they assign the key chains to the bags given these
restrictions?
Transcribed Image Text:Problem 3 : Souvenir Key-chain Bins For each of these problems, write down the permutation/combination expression and then sim- plify to a final number. Alice (she/her) and Bob (he/him) are going souvenir hunting during Spring Break. They come across a store that sells all sorts of key-chains. i. If they buy 75 key-chains, and have six bags to store the key-chains, how many different ways can the key-chains be assigned to the bags? ii. Assume that they pick 19 "Sunny Miami" key-chains and only these 19 key-chains. Both Alice and Bob really like this key-chain, so they want each of the six bags to have at least two of them. How many different ways can the "Sunny Miami" key chains be assigned to the bags? iii. Assume they buy 32 “Ft. Lauderdale" key chains and want to distribute them in six bags, one for each friend. They want to make sure everyone has at least 3 key-chains, but no more than 9 key-chains. How many ways can they assign the key chains to the bags given these restrictions?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,