Problem 44
Question
Use the formula for \(_{n} P_{r}\) to solve Exercises \(41-48\) Suppose you are asked to list, in order of preference, the three best movies you have seen this year. If you saw 20 movies during the year, in how many ways can the three best be chosen and ranked?
Step-by-Step Solution
Verified Answer
There are 6840 ways the three best movies can be chosen and ranked.
1Step 1: Understand the notation
\(_{n}P_{r}\) is the notation for permutations of \(n\) things taken \(r\) at a time. Here, \(n = 20\) (the total number of movies seen) and \(r = 3\) (the number of movies to be ranked).
2Step 2: Apply the permutation formula
The formula for permutations is \(_{n} P_{r} = \frac{n!}{(n-r)!}\). Apply this formula with the given values of \(n\) and \(r\). So, \(_{20} P_{3} = \frac{20!}{(20-3)!}\).
3Step 3: Solve the factorial
Factorial means multiplying all positive integers up to that number. To tackle the factorials, realize that \(20! = 20 * 19 * 18 * 17!\) and in the denominator we have \(17!\) these cancel out leaving \(20 * 19 * 18\) in the numerator.
4Step 4: Final calculation
Perform the multiplication: \(20 * 19 * 18 = 6840\).
Other exercises in this chapter
Problem 43
Find the sum of each infinite geometric series. $$\sum_{i=1}^{\infty} 8(-0.3)^{i-1}$$
View solution Problem 43
Express each sum using summation notation. Use I as the lower limit of summation and i for the index of summation. $$1^{2}+2^{2}+3^{2}+\dots+15^{2}$$
View solution Problem 44
In Exercises \(43-44\), find \(S_{1}\) through \(S_{5}\) and then use the pattern to make a conjecture about \(S_{n}\). Prove the conjectured formula for \(S_{n
View solution Problem 44
Find the sum of the odd integers between 30 and 54
View solution