Years
>
Year 12>
Permutations and Combinations>
Combinations with Restrictions>
Combinations with Restrictions 2Combinations with Restrictions 2
Try VividMath Premium to unlock full access
Time limit: 0
Quiz summary
0 of 5 questions completed
Questions:
- 1
- 2
- 3
- 4
- 5
Information
–
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Loading...
- 1
- 2
- 3
- 4
- 5
- Answered
- Review
-
Question 1 of 5
1. Question
In how many ways can 22 Blue marbles and 11 Red marble be drawn from the jar below?- (30)
Hint
Help VideoCorrect
Excellent!
Incorrect
Need TextPlayCurrent Time 0:00/Duration Time 0:00Remaining Time -0:00Stream TypeLIVELoaded: 0%Progress: 0%0:00Fullscreen00:00MutePlayback Rate1x- 2x
- 1.5x
- 1.25x
- 1x
- 0.75x
- 0.5x
Subtitles- subtitles off
Captions- captions off
- English
Chapters- Chapters
Use the combinations formula to find the number of ways an item can be chosen (r)(r) from the total number of items (n)(n).Remember that order is not important in Combinations.Combination Formula
nCr=n!(n−r)!r!nCr=n!(n−r)!r!First, find the ways that 22 Blue marbles can be drawn. There are 55 Blue marbles in the jar, which means:r=2r=2n=5n=5nCrnCr == n!(n−r)!r!n!(n−r)!r! Combination Formula 5C25C2 == 5!(5−2)!2!5!(5−2)!2! Substitute the values of rr and nn == 5!3!2!5!3!2! == 5⋅4⋅3⋅2⋅13⋅2⋅1⋅2⋅15⋅4⋅3⋅2⋅13⋅2⋅1⋅2⋅1 == 202202 == 1010 Next, find the ways that 11 Red marble can be drawn. There are 33 Red marbles in the jar, which means:r=1r=1n=3n=3nCrnCr == n!(n−r)!r!n!(n−r)!r! Combination Formula 3C13C1 == 3!(3−1)!1!3!(3−1)!1! Substitute the values of rr and nn == 3!2!1!3!2!1! == 3⋅2!2!3⋅2!2! == 33 2!2!2!2! cancels out Finally, multiply the two solved combinationsNumber of ways 22 Blue marbles can be drawn=10=10Number of ways 11 Red marble can be drawn =3=310⋅310⋅3 == 3030 Therefore, there are 3030 ways of drawing 22 Blue marbles and 11 Red marble from the jar.3030 -
Question 2 of 5
2. Question
In how many ways can 11 marble of each color be drawn from the jar below?- (30)
Hint
Help VideoCorrect
Nice Job!
Incorrect
Need TextPlayCurrent Time 0:00/Duration Time 0:00Remaining Time -0:00Stream TypeLIVELoaded: 0%Progress: 0%0:00Fullscreen00:00MutePlayback Rate1x- 2x
- 1.5x
- 1.25x
- 1x
- 0.75x
- 0.5x
Subtitles- subtitles off
Captions- captions off
- English
Chapters- Chapters
Use the combinations formula to find the number of ways an item can be chosen (r)(r) from the total number of items (n)(n).Remember that order is not important in Combinations.Combination Formula
nCr=n!(n−r)!r!nCr=n!(n−r)!r!First, find the ways that 11 Blue marble can be drawn. There are 55 Blue marbles in the jar, which means:r=1r=1n=5n=5nCrnCr == n!(n−r)!r!n!(n−r)!r! Combination Formula 5C15C1 == 5!(5−1)!1!5!(5−1)!1! Substitute the values of rr and nn == 5!4!1!5!4!1! == 5⋅4⋅3⋅2⋅14⋅3⋅2⋅15⋅4⋅3⋅2⋅14⋅3⋅2⋅1 == 55 Next, find the ways that 11 Red marble can be drawn. There are 33 Red marbles in the jar, which means:r=1r=1n=3n=3nCrnCr == n!(n−r)!r!n!(n−r)!r! Combination Formula 3C13C1 == 3!(3−1)!1!3!(3−1)!1! Substitute the values of rr and nn == 3!2!1!3!2!1! == 3⋅2⋅12⋅13⋅2⋅12⋅1 == 33 Now, find the ways that 11 Black marble can be drawn. There are 22 Black marbles in the jar, which means:r=1r=1n=2n=2nCrnCr == n!(n−r)!r!n!(n−r)!r! Combination Formula 2C12C1 == 2!(2−1)!1!2!(2−1)!1! Substitute the values of rr and nn == 2!1!1!2!1!1! == 2⋅12⋅1 == 22 Finally, multiply the three solved combinationsNumber of ways 11 Blue marble can be drawn=5=5Number of ways 11 Red marble can be drawn =3=3Number of ways 11 Black marble can be drawn =2=25⋅3⋅25⋅3⋅2 == 3030 Therefore, there are 3030 ways of drawing 11 marble of each color from the jar.3030 -
Question 3 of 5
3. Question
You are asked to buy at least 66 flavors of chips out of 1010 total flavors. How many combinations of chips can you buy?- (386)
Hint
Help VideoCorrect
Keep Going!
Incorrect
Need TextPlayCurrent Time 0:00/Duration Time 0:00Remaining Time -0:00Stream TypeLIVELoaded: 0%Progress: 0%0:00Fullscreen00:00MutePlayback Rate1x- 2x
- 1.5x
- 1.25x
- 1x
- 0.75x
- 0.5x
Subtitles- subtitles off
Captions- captions off
- English
Chapters- Chapters
Use the combinations formula to find the number of ways an item can be chosen (r)(r) from the total number of items (n)(n).Remember that order is not important in Combinations.Combination Formula
nCr=n!(n−r)!r!nCr=n!(n−r)!r!Since you are asked to buy at least 66 flavors of chips, it means you can either buy 6,7,8,96,7,8,9 or 1010 chips out of 1010 total flavors of chips. Add all combinations for each number.r=6,7,8,9,10r=6,7,8,9,10n=10n=1010C6+10C7+10C8+10C9+10C1010C6+10C7+10C8+10C9+10C10 == 210+120+45+10+1210+120+45+10+1 Use the calculator’s combination function == 386386 There are 386386 combinations possible in buying at least 66 flavors of chips out of 1010 total flavors.386386 -
Question 4 of 5
4. Question
In how many ways can an artist buy at most 77 tubes of paint out of 1212 different tubes?- (3302, 3 302, 3,302)
Hint
Help VideoCorrect
Excellent!
Incorrect
Need TextPlayCurrent Time 0:00/Duration Time 0:00Remaining Time -0:00Stream TypeLIVELoaded: 0%Progress: 0%0:00Fullscreen00:00MutePlayback Rate1x- 2x
- 1.5x
- 1.25x
- 1x
- 0.75x
- 0.5x
Subtitles- subtitles off
Captions- captions off
- English
Chapters- Chapters
Use the combinations formula to find the number of ways an item can be chosen (r)(r) from the total number of items (n)(n).Remember that order is not important in Combinations.Combination Formula
nCr=n!(n−r)!r!nCr=n!(n−r)!r!Since the artist is buying at most 7 tubes of paint, it means he can either buy 0,1,2,3,4,5,6 or 7 tubes out of 12 different tubes. Add all combinations for each number.r=0,1,2,3,4,5,6,7n=1212C0+12C1+12C2+12C3+12C4+12C5+12C6+12C7 = 1+12+66+220+495+792+924+792 Use the calculator’s combination function = 3302 There are 3302 combinations possible in buying at most 7 tubes of paint out of 12 different tubes.3302 -
Question 5 of 5
5. Question
Jessica wants to buy 2 cats and 3 dogs, where one of the dogs must be a German Shepherd. In how many ways can she choose these pets given that the pet shop has the following pets:Note that only one of these dogs is a German Shepherd- (60)
Hint
Help VideoCorrect
Well Done!
Incorrect
Need TextPlayCurrent Time 0:00/Duration Time 0:00Remaining Time -0:00Stream TypeLIVELoaded: 0%Progress: 0%0:00Fullscreen00:00MutePlayback Rate1x- 2x
- 1.5x
- 1.25x
- 1x
- 0.75x
- 0.5x
Subtitles- subtitles off
Captions- captions off
- English
Chapters- Chapters
Use the combinations formula to find the number of ways an item can be chosen (r) from the total number of items (n).Remember that order is not important in Combinations.Combination Formula
nCr=n!(n−r)!r!First, find the ways that the 2 cats can be chosen. There are only 4 cats available, which means:r=2n=4nCr = n!(n−r)!r! Combination Formula 4C2 = 4!(4−2)!2! Substitute the values of r and n = 4!2!2! = 4⋅3⋅2⋅12⋅1⋅2⋅1 = 122 = 6 Next, find the different ways that 1 German Shepherd (r) can be chosen from 1 German Shepherd (n)r=1n=1nCr = n!(n−r)!r! Combination Formula 1C1 = 1!(1−1)!1! Substitute the values of r and n = 1!0!1! = 1 0!=1 Now, find the different ways that the 2 other dogs (r) can be chosen from a total of 5 remaining dogs (n)r=2n=5nCr = n!(n−r)!r! Combination Formula 5C2 = 5!(5−2)!2! Substitute the values of r and n = 5!3!2! = 5⋅4⋅3⋅2⋅13⋅2⋅1⋅2⋅1 = 202 = 10 Finally, multiply the three solved combinationsNumber of ways the 3 cats can be chosen=6Number of ways the German Shepherd can be chosen=1Number of ways the 2 dogs can be chosen=106⋅1⋅10 = 60 Therefore, there are 60 ways of choosing 2 cats and 3 dogs where one of the dogs is a German Shepherd.60
Quizzes
- Factorial Notation
- Fundamental Counting Principle 1
- Fundamental Counting Principle 2
- Fundamental Counting Principle 3
- Combinations 1
- Combinations 2
- Combinations with Restrictions 1
- Combinations with Restrictions 2
- Combinations with Probability
- Basic Permutations 1
- Basic Permutations 2
- Basic Permutations 3
- Permutation Problems 1
- Permutation Problems 2
- Permutations with Repetitions 1
- Permutations with Repetitions 2
- Permutations with Restrictions 1
- Permutations with Restrictions 2
- Permutations with Restrictions 3
- Permutations with Restrictions 4