Mathematics All Around (6th Edition)
6th Edition
ISBN: 9780134506470
Author: Pirnot
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 12.2, Problem 20E
A piano competition. In the Van Cliburn piano competition, the contestants must choose three pieces to perform: one of five from the classical period, one of seven from the romantic period, and one of eight from the modern period. In how many ways can a contestant choose pieces for his or her program?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
There are three options for investing $1150. The first earns 10% compounded annually, the second earns 10% compounded quarterly, and the third earns 10% compounded continuously. Find equations that model each investment growth and
use a graphing utility to graph each model in the same viewing window over a 20-year period. Use the graph to determine which investment yields the highest return after 20 years. What are the differences in earnings among the three
investment?
STEP 1: The formula for compound interest is
A =
nt
= P(1 + − − ) n²,
where n is the number of compoundings per year, t is the number of years, r is the interest rate, P is the principal, and A is the amount (balance) after t years. For continuous compounding, the formula reduces to
A = Pert
Find r and n for each model, and use these values to write A in terms of t for each case.
Annual Model
r=0.10
A = Y(t) = 1150 (1.10)*
n = 1
Quarterly Model
r = 0.10
n = 4
A = Q(t) = 1150(1.025) 4t
Continuous Model
r=0.10
A = C(t) =…
The following ordered data list shows the data speeds for cell phones used by a
telephone company at an airport:
A. Calculate the Measures of Central Tendency from the ungrouped data list.
B. Group the data in an appropriate frequency table.
C. Calculate the Measures of Central Tendency using the table in point B.
D. Are there differences in the measurements obtained in A and C? Why (give at
least one justified reason)?
I leave the answers to A and B to resolve the remaining two.
0.8
1.4
1.8
1.9
3.2
3.6
4.5
4.5
4.6
6.2
6.5
7.7
7.9
9.9
10.2
10.3
10.9
11.1
11.1
11.6
11.8
12.0
13.1
13.5
13.7
14.1
14.2
14.7
15.0
15.1
15.5
15.8
16.0
17.5
18.2
20.2
21.1
21.5
22.2
22.4
23.1
24.5
25.7
28.5
34.6
38.5
43.0
55.6
71.3
77.8
A. Measures of Central Tendency
We are to calculate:
Mean, Median, Mode
The data (already ordered) is:
0.8, 1.4, 1.8, 1.9, 3.2, 3.6, 4.5, 4.5, 4.6, 6.2, 6.5, 7.7, 7.9, 9.9, 10.2, 10.3, 10.9,
11.1, 11.1, 11.6,
11.8, 12.0, 13.1, 13.5, 13.7, 14.1, 14.2, 14.7, 15.0, 15.1, 15.5,…
A tournament is a complete directed graph, for each pair of vertices x, y either (x, y) is an arc or
(y, x) is an arc. One can think of this as a round robin tournament, where the vertices represent
teams, each pair plays exactly once, with the direction of the arc indicating which team wins.
(a) Prove that every tournament has a direct Hamiltonian path. That is a labeling of the teams
V1, V2,..., Un so that vi beats Vi+1. That is a labeling so that team 1 beats team 2, team 2
beats team 3, etc.
(b) A digraph is strongly connected if there is a directed path from any vertex to any other
vertex. Equivalently, there is no partition of the teams into groups A, B so that every team
in A beats every team in B. Prove that every strongly connected tournament has a directed
Hamiltonian cycle. Use this to show that for any team there is an ordering as in part (a) for
which the given team is first.
(c) A king in a tournament is a vertex such that there is a direct path of length at most 2 to
any…
Chapter 12 Solutions
Mathematics All Around (6th Edition)
Ch. 12.1 - In Exercises 14, you are selecting from the set...Ch. 12.1 - In Exercises 14, you are selecting from the set...Ch. 12.1 - In Exercises 14, you are selecting from the set...Ch. 12.1 - In Exercises 14, you are selecting from the set...Ch. 12.1 - Prob. 5ECh. 12.1 - Prob. 6ECh. 12.1 - Prob. 7ECh. 12.1 - Prob. 8ECh. 12.1 - How many different two-digit numbers can you form...Ch. 12.1 - How many different two-digit numbers can you form...
Ch. 12.1 - How many different three-digit numbers can you...Ch. 12.1 - How many different three-digit numbers can you...Ch. 12.1 - In Exercises 1318, assume you are rolling two...Ch. 12.1 - In Exercises 1318, assume you are rolling two...Ch. 12.1 - In Exercises 1318, assume you are rolling two...Ch. 12.1 - In Exercises 1318, assume you are rolling two...Ch. 12.1 - In Exercises 1318, assume you are rolling two...Ch. 12.1 - In Exercises 1318, assume you are rolling two...Ch. 12.1 - Recall in Example 6 that you are creating outfits...Ch. 12.1 - Recall in Example 6 that you are creating outfits...Ch. 12.1 - Use the given diagram to solve Exercises 21 and...Ch. 12.1 - Use the given diagram to solve Exercises 21 and...Ch. 12.1 - Answer Exercise 21 assuming the diagram has six...Ch. 12.1 - Prob. 24ECh. 12.1 - Assigning tasks. Stefans friends Amika, Pam, Li,...Ch. 12.1 - Making staff assignments. Suppose that the staff...Ch. 12.1 - Prob. 27ECh. 12.1 - Prob. 28ECh. 12.1 - The role-playing game Dungeons & Dragons uses a...Ch. 12.1 - Dungeons & Dragons also uses 12-sided dice. How...Ch. 12.1 - Counting license plates. An eyewitness to a crime...Ch. 12.1 - Counting license plates. In a small state, the...Ch. 12.1 - For Exercises 33 and 34, use the figures below....Ch. 12.1 - For Exercises 33 and 34, use the figures below....Ch. 12.1 - Prince William and Duchess Kate are attending the...Ch. 12.1 - Prince William and Duchess Kate are attending the...Ch. 12.1 - Prob. 37ECh. 12.1 - Prob. 38ECh. 12.1 - Stacking cans. In preparation for Thanksgiving...Ch. 12.1 - Prob. 40ECh. 12.1 - In Exercises 4144, you are buying a triple-deck...Ch. 12.1 - In Exercises 4144, you are buying a triple-deck...Ch. 12.1 - In Exercises 4144, you are buying a triple-deck...Ch. 12.1 - In Exercises 4144, you are buying a triple-deck...Ch. 12.1 - Prob. 45ECh. 12.1 - Prob. 46ECh. 12.1 - Prob. 47ECh. 12.1 - Prob. 49ECh. 12.1 - Prob. 50ECh. 12.1 - Prob. 51ECh. 12.1 - Prob. 52ECh. 12.1 - Prob. 53ECh. 12.1 - Prob. 54ECh. 12.1 - Prob. 55ECh. 12.1 - Prob. 56ECh. 12.1 - Prob. 57ECh. 12.1 - Prob. 58ECh. 12.1 - Prob. 59ECh. 12.2 - Assigning responsibilities. The board of an...Ch. 12.2 - Assigning positions. If there are 12 members on...Ch. 12.2 - Assigning officers. The Equestrian Club has eight...Ch. 12.2 - Assigning officers. If the Chamber of Commerce has...Ch. 12.2 - Choosing a stand up paddle board package. Kevin...Ch. 12.2 - Counting schedules. Jorge is using his educational...Ch. 12.2 - Counting meal possibilities. The early bird...Ch. 12.2 - Prob. 8ECh. 12.2 - In games such as Dungeons 12, determine the number...Ch. 12.2 - In games such as Dungeons 12, determine the number...Ch. 12.2 - In games such as Dungeons 12, determine the number...Ch. 12.2 - In games such as Dungeons 12, determine the number...Ch. 12.2 - In Exercises 1316, using the digits 0,1,2,...,8,9,...Ch. 12.2 - In Exercises 1316, using the digits 0,1,2,...,8,9,...Ch. 12.2 - In Exercises 1316, using the digits 0,1,2,...,8,9,...Ch. 12.2 - Prob. 16ECh. 12.2 - A truefalse quiz. In how many ways can you choose...Ch. 12.2 - A multiple-choice test. In how many ways can you...Ch. 12.2 - Planning a trip. Center City Community Colleges...Ch. 12.2 - A piano competition. In the Van Cliburn piano...Ch. 12.2 - Enumerating call letters. Radio stations in the...Ch. 12.2 - Prob. 22ECh. 12.2 - Prob. 23ECh. 12.2 - Counting license plates. In a certain state,...Ch. 12.2 - A pin tumbler lock has a series of pins, each of...Ch. 12.2 - A pin tumbler lock has a series of pins, each of...Ch. 12.2 - Counting routes for an armored van. A Wells Fargo...Ch. 12.2 - Prob. 28ECh. 12.2 - Prob. 29ECh. 12.2 - Facial arrangements. A website enables you to...Ch. 12.2 - Prob. 31ECh. 12.2 - Prob. 32ECh. 12.2 - Exercises 33 and 34 are alternative versions of...Ch. 12.2 - Prob. 34ECh. 12.2 - Prob. 35ECh. 12.2 - Assume that we wish to seat three men and three...Ch. 12.2 - Assume that we wish to seat three men and three...Ch. 12.2 - Assume that we wish to seat three men and three...Ch. 12.2 - In solving counting problems, it is often useful...Ch. 12.2 - What is the relationship between trees, slot...Ch. 12.2 - Prob. 41ECh. 12.2 - Prob. 42ECh. 12.2 - Prob. 43ECh. 12.2 - Prob. 44ECh. 12.2 - Prob. 45ECh. 12.2 - Prob. 46ECh. 12.2 - Prob. 47ECh. 12.2 - Prob. 48ECh. 12.2 - Prob. 49ECh. 12.3 - In Exercises 112, calculate each value. 4!Ch. 12.3 - Prob. 2ECh. 12.3 - In Exercises 112, calculate each value. (85)!Ch. 12.3 - In Exercises 112, calculate each value. (105)!Ch. 12.3 - In Exercises 112, calculate each value. 107Ch. 12.3 - In Exercises 112, calculate each value. 119Ch. 12.3 - Prob. 7ECh. 12.3 - In Exercises 112, calculate each value. 1192Ch. 12.3 - In Exercises 112, calculate each value. P(6,2)Ch. 12.3 - In Exercises 112, calculate each value. P(5,3)Ch. 12.3 - In Exercises 112, calculate each value. C(10,3)Ch. 12.3 - In Exercises 112, calculate each value. C(4,4)Ch. 12.3 - Prob. 13ECh. 12.3 - Prob. 14ECh. 12.3 - In Exercises 1518 find the number of permutations....Ch. 12.3 - In Exercises 1518 find the number of permutations....Ch. 12.3 - In Exercises 1518 find the number of permutations....Ch. 12.3 - In Exercises 1518 find the number of permutations....Ch. 12.3 - In Exercises 1922, find the number of...Ch. 12.3 - Prob. 20ECh. 12.3 - In Exercises 1922, find the number of...Ch. 12.3 - Prob. 22ECh. 12.3 - Find the eighth row in Pascals triangle.Ch. 12.3 - Find the tenth row in Pascals triangle.Ch. 12.3 - Use the seventh row of Pascals triangle to answer...Ch. 12.3 - Prob. 26ECh. 12.3 - Prob. 27ECh. 12.3 - In Exercises 2730, describe where each number is...Ch. 12.3 - Prob. 29ECh. 12.3 - In Exercises 2730, describe where each number is...Ch. 12.3 - In Exercises 3144, specify the number of ways to...Ch. 12.3 - Prob. 32ECh. 12.3 - In Exercises 3144, specify the number of ways to...Ch. 12.3 - Prob. 34ECh. 12.3 - In Exercises 3144, specify the number of ways to...Ch. 12.3 - Prob. 36ECh. 12.3 - Prob. 37ECh. 12.3 - Prob. 38ECh. 12.3 - In Exercises 3144, specify the number of ways to...Ch. 12.3 - In Exercises 3144, specify the number of ways to...Ch. 12.3 - In Exercises 3144, specify the number of ways to...Ch. 12.3 - Prob. 42ECh. 12.3 - In Exercises 3144, specify the number of ways to...Ch. 12.3 - In Exercises 3144, specify the number of ways to...Ch. 12.3 - In Exercises 4548, determine the number of ways to...Ch. 12.3 - Prob. 46ECh. 12.3 - Prob. 47ECh. 12.3 - Prob. 48ECh. 12.3 - In Exercise 49 and 50, determine why the given...Ch. 12.3 - Prob. 50ECh. 12.3 - Prob. 51ECh. 12.3 - A typical bingo card is shown in the figure. The...Ch. 12.3 - Prob. 53ECh. 12.3 - A typical bingo card is shown in the figure. The...Ch. 12.3 - In Exercise 5568, use the fundamental counting...Ch. 12.3 - In Exercise 5568, use the fundamental counting...Ch. 12.3 - In Exercise 5568, use the fundamental counting...Ch. 12.3 - Prob. 58ECh. 12.3 - Prob. 59ECh. 12.3 - Prob. 60ECh. 12.3 - In Exercise 5568, use the fundamental counting...Ch. 12.3 - Prob. 62ECh. 12.3 - Prob. 63ECh. 12.3 - Prob. 64ECh. 12.3 - In Exercise 5568, use the fundamental counting...Ch. 12.3 - Prob. 66ECh. 12.3 - Prob. 67ECh. 12.3 - Prob. 68ECh. 12.3 - Prob. 69ECh. 12.3 - Prob. 70ECh. 12.3 - Prob. 71ECh. 12.3 - Prob. 72ECh. 12.3 - Prob. 73ECh. 12.3 - Prob. 74ECh. 12.3 - Prob. 75ECh. 12.3 - Prob. 76ECh. 12.3 - Prob. 77ECh. 12.3 - Prob. 78ECh. 12.3 - Prob. 79ECh. 12.3 - Prob. 80ECh. 12.3 - Prob. 81ECh. 12.3 - Prob. 82ECh. 12.3 - Prob. 83ECh. 12.3 - Prob. 84ECh. 12.3 - Prob. 85ECh. 12.3 - Prob. 86ECh. 12.3 - Prob. 87ECh. 12.3 - Prob. 88ECh. 12.3 - Prob. 89ECh. 12.4 - Exercises 16 are based on the slot machine shown...Ch. 12.4 - Exercises 16 are based on the slot machine shown...Ch. 12.4 - Exercises 16 are based on the slot machine shown...Ch. 12.4 - Exercises 16 are based on the slot machine shown...Ch. 12.4 - Prob. 5ECh. 12.4 - Exercises 16 are based on the slot machine shown...Ch. 12.4 - Exercises 712 deal with the poker hands described...Ch. 12.4 - Exercises 712 deal with the poker hands described...Ch. 12.4 - Prob. 9ECh. 12.4 - Exercises 712 deal with the poker hands described...Ch. 12.4 - Exercises 712 deal with the poker hands described...Ch. 12.4 - Exercises 712 deal with the poker hands described...Ch. 12.4 - Prob. 13ECh. 12.4 - Why are we using combinations rather than...Ch. 12.4 - Prob. 15ECh. 12.4 - Prob. 16ECh. 12.4 - Playing poker. How many poker hands are less in...Ch. 12.CR - Prob. 1CRCh. 12.CR - The game Dungeons & Dragons uses a tetrahedral die...Ch. 12.CR - Prob. 3CRCh. 12.CR - Prob. 4CRCh. 12.CR - Prob. 5CRCh. 12.CR - Prob. 6CRCh. 12.CR - Prob. 7CRCh. 12.CR - Prob. 8CRCh. 12.CR - Prob. 9CRCh. 12.CR - Prob. 10CRCh. 12.CR - You are going to serve gourmet cupcakes at your...Ch. 12.CR - Prob. 12CRCh. 12.CR - Prob. 13CRCh. 12.CR - Prob. 14CRCh. 12.CR - Prob. 15CRCh. 12.CR - Prob. 16CRCh. 12.CR - Prob. 17CRCh. 12.CT - List all the ways you can select two different...Ch. 12.CT - Prob. 2CTCh. 12.CT - Prob. 3CTCh. 12.CT - Use the sixth row of Pascals triangle to find the...Ch. 12.CT - Prob. 5CTCh. 12.CT - Prob. 6CTCh. 12.CT - Prob. 7CTCh. 12.CT - Prob. 8CTCh. 12.CT - Prob. 9CTCh. 12.CT - Prob. 10CTCh. 12.CT - Prob. 11CTCh. 12.CT - Prob. 12CTCh. 12.CT - Write an equation that relates the expressions...Ch. 12.CT - Prob. 14CTCh. 12.CT - Prob. 15CTCh. 12.CT - Prob. 16CT
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Use a graphing utility to find the point of intersection, if any, of the graphs of the functions. Round your result to three decimal places. (Enter NONE in any unused answer blanks.) y = 100e0.01x (x, y) = y = 11,250 ×arrow_forwardhow to construct the following same table?arrow_forwardThe following is known. The complete graph K2t on an even number of vertices has a 1- factorization (equivalently, its edges can be colored with 2t - 1 colors so that the edges incident to each vertex are distinct). This implies that the complete graph K2t+1 on an odd number of vertices has a factorization into copies of tK2 + K₁ (a matching plus an isolated vertex). A group of 10 people wants to set up a 45 week tennis schedule playing doubles, each week, the players will form 5 pairs. One of the pairs will not play, the other 4 pairs will each play one doubles match, two of the pairs playing each other and the other two pairs playing each other. Set up a schedule with the following constraints: Each pair of players is a doubles team exactly 4 times; during those 4 matches they see each other player exactly once; no two doubles teams play each other more than once. (a) Find a schedule. Hint - think about breaking the 45 weeks into 9 blocks of 5 weeks. Use factorizations of complete…arrow_forward
- . The two person game of slither is played on a graph. Players 1 and 2 take turns, building a path in the graph. To start, Player 1 picks a vertex. Player 2 then picks an edge incident to the vertex. Then, starting with Player 1, players alternate turns, picking a vertex not already selected that is adjacent to one of the ends of the path created so far. The first player who cannot select a vertex loses. (This happens when all neighbors of the end vertices of the path are on the path.) Prove that Player 2 has a winning strategy if the graph has a perfect matching and Player 1 has a winning strategy if the graph does not have a perfect matching. In each case describe a strategy for the winning player that guarantees that they will always be able to select a vertex. The strategy will be based on using a maximum matching to decide the next choice, and will, for one of the cases involve using the fact that maximality means no augmenting paths. Warning, the game slither is often described…arrow_forwardLet D be a directed graph, with loops allowed, for which the indegree at each vertex is at most k and the outdegree at each vertex is at most k. Prove that the arcs of D can be colored so that the arcs entering each vertex must have distinct colors and the arcs leaving each vertex have distinct colors. An arc entering a vertex may have the same color as an arc leaving it. It is probably easiest to make use of a known result about edge coloring. Think about splitting each vertex into an ‘in’ and ‘out’ part and consider what type of graph you get.arrow_forward3:56 wust.instructure.com Page 0 Chapter 5 Test Form A of 2 - ZOOM + | Find any real numbers for which each expression is undefined. 2x 4 1. x Name: Date: 1. 3.x-5 2. 2. x²+x-12 4x-24 3. Evaluate when x=-3. 3. x Simplify each rational expression. x²-3x 4. 2x-6 5. x²+3x-18 x²-9 6. Write an equivalent rational expression with the given denominator. 2x-3 x²+2x+1(x+1)(x+2) Perform the indicated operation and simplify if possible. x²-16 x-3 7. 3x-9 x²+2x-8 x²+9x+20 5x+25 8. 4.x 2x² 9. x-5 x-5 3 5 10. 4x-3 8x-6 2 3 11. x-4 x+4 x 12. x-2x-8 x²-4 ← -> Copyright ©2020 Pearson Education, Inc. + 5 4. 5. 6. 7. 8. 9. 10. 11. 12. T-97arrow_forward
- please work out more details give the solution.arrow_forwardProblem #5 Suppose you flip a two sided fair coin ("heads" or "tails") 8 total times. a). How many ways result in 6 tails and 2 heads? b). How many ways result in 2 tails and 6 heads? c). Compare your answers to part (a) and (b) and explain in a few sentences why the comparison makes sense.arrow_forwardBurger Dome sells hamburgers, cheeseburgers, french fries, soft drinks, and milk shakes, as well as a limited number of specialty items and dessert selections. Although Burger Dome would like to serve each customer immediately, at times more customers arrive than can be handled by the Burger Dome food service staff. Thus, customers wait in line to place and receive their orders. Burger Dome analyzed data on customer arrivals and concluded that the arrival rate is 30 customers per hour. Burger Dome also studied the order-filling process and found that a single employee can process an average of 44 customer orders per hour. Burger Dome is concerned that the methods currently used to serve customers are resulting in excessive waiting times and a possible loss of sales. Management wants to conduct a waiting line study to help determine the best approach to reduce waiting times and improve service. Suppose Burger Dome establishes two servers but arranges the restaurant layout so that an…arrow_forward
- PEER REPLY 1: Choose a classmate's Main Post. 1. Indicate a range of values for the independent variable (x) that is reasonable based on the data provided. 2. Explain what the predicted range of dependent values should be based on the range of independent values.arrow_forwardNote: A waiting line model solver computer package is needed to answer these questions. The Kolkmeyer Manufacturing Company uses a group of six identical machines, each of which operates an average of 18 hours between breakdowns. With randomly occurring breakdowns, the Poisson probability distribution is used to describe the machine breakdown arrival process. One person from the maintenance department provides the single-server repair service for the six machines. Management is now considering adding two machines to its manufacturing operation. This addition will bring the number of machines to eight. The president of Kolkmeyer asked for a study of the need to add a second employee to the repair operation. The service rate for each individual assigned to the repair operation is 0.50 machines per hour. (a) Compute the operating characteristics if the company retains the single-employee repair operation. (Round your answers to four decimal places. Report time in hours.) La = L = Wa = W =…arrow_forward10 20 30 y vernier protractor scales. 60 30 0 30 60 40 30 20 10 0 30 60 0 10. Write the complement of each of the following angles. a. 67° b. 17°41' 11. Write the supplement of each of the following angles. a.41° b.99°32' 30 60 C. 20 10 20 90 60 30 69 30 30 40 50 c. 54°47' 53" 0 30 60 c. 103°03'27" 12. Given: AB CD and EF GH. Determine the value of each angle, 21 through /10, to the nearer minute. A- 25 21 = 22 = 23 = 24 = 25 = 46= 27 = C 28 = 29 = 210 = E 26 22 210 81°00' 29 4 142°00' G H 94°40' B Darrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
College AlgebraAlgebraISBN:9781305115545Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage Learning
Algebra and Trigonometry (MindTap Course List)AlgebraISBN:9781305071742Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage Learning
College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
College Algebra
Algebra
ISBN:9781305115545
Author:James Stewart, Lothar Redlin, Saleem Watson
Publisher:Cengage Learning
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:9781305071742
Author:James Stewart, Lothar Redlin, Saleem Watson
Publisher:Cengage Learning
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Glencoe Algebra 1, Student Edition, 9780079039897...
Algebra
ISBN:9780079039897
Author:Carter
Publisher:McGraw Hill
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Find number of persons in a part with 66 handshakes Combinations; Author: Anil Kumar;https://www.youtube.com/watch?v=33TgLi-wp3E;License: Standard YouTube License, CC-BY
Discrete Math 6.3.1 Permutations and Combinations; Author: Kimberly Brehm;https://www.youtube.com/watch?v=J1m9sB5XZQc;License: Standard YouTube License, CC-BY
How to use permutations and combinations; Author: Mario's Math Tutoring;https://www.youtube.com/watch?v=NEGxh_D7yKU;License: Standard YouTube License, CC-BY
Permutations and Combinations | Counting | Don't Memorise; Author: Don't Memorise;https://www.youtube.com/watch?v=0NAASclUm4k;License: Standard Youtube License
Permutations and Combinations Tutorial; Author: The Organic Chemistry Tutor;https://www.youtube.com/watch?v=XJnIdRXUi7A;License: Standard YouTube License, CC-BY