Answer:
This can be done in 3645 ways
Step-by-step explanation:
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:
In this problem, we have that:
1 Beethoven symphony, from a set of 9.
1 Mozart concerto, from a set of 27.
1 string quartets, from a set of 15.
So
This can be done in 3645 ways
Answer:
Minimum = 14
Median = 32
Maximum = 65
Step-by-step explanation:
<u>Step 1: </u>Put your numbers in ascending order (from smallest to largest). For this particular data set, the order is
14, 18, 28, 29, 32, 44, 48, 50, 65
<u>Step 2:</u> Find the minimum and maximum for your data set. Now that your numbers are in order, this should be easy to spot.
Minimum = 14
Maximum = 65
<u>Step 3: </u>Find the median. The median is the middle number. The middle number in your list is 32, so
Median = 32
<u>Step 4: </u>Place parentheses around the numbers above and below the median.
(14, 18, 28, 29), 32, (44, 48, 50, 65)
<u>Step 5: </u>Find Q1 and Q3. Q1 can be thought of as a median in the lower half of the data, and Q3 can be thought of as a median for the upper half of data.
First quartile
Third quartile
<u>Step 6:</u> Write down your summary found in the above steps.
Minimum = 14
Median = 32
Maximum = 65