Skip to main content
Ch. 3 - Probability
Larson - Elementary Statistics: Picturing the World 8th Edition
Larson8th EditionElementary Statistics: Picturing the WorldISBN: 9780137493470당신이 사용하는 게 아니라요?교과서 변경
3장, 문제 3.4.23

23. Footrace There are 72 runners in a 10-kilometer race. How many ways can the runners finish first, second, and third?

검증된 단계별 안내
1
Step 1: Recognize that this is a permutation problem because the order in which the runners finish (first, second, and third) matters.
Step 2: Use the formula for permutations, which is P(n, r) = n! / (n - r)!, where n is the total number of items (runners) and r is the number of positions to fill (first, second, and third).
Step 3: Substitute the given values into the formula: n = 72 (total runners) and r = 3 (positions to fill). The formula becomes P(72, 3) = 72! / (72 - 3)!.
Step 4: Simplify the denominator: (72 - 3)! = 69!, so the formula becomes P(72, 3) = 72 × 71 × 70 (since the factorial terms beyond 69! cancel out).
Step 5: Multiply the remaining terms (72 × 71 × 70) to find the total number of ways the runners can finish first, second, and third.

비슷한 문제에 대한 검증된 영상 답변:

이 영상 해법은 위 문제에 도움이 된다고 튜터들이 추천한 것입니다.
영상 길이:
2m
도움이 되었나요?

주요 개념

질문에 올바르게 답하기 위해 반드시 이해해야 하는 핵심 개념들은 다음과 같습니다.

Permutations

Permutations refer to the different arrangements of a set of items where the order matters. In this context, we are interested in the arrangements of the top three finishers among 72 runners. The formula for permutations is given by n! / (n - r)!, where n is the total number of items, and r is the number of items to arrange.
추천 영상:
가이드 코스
07:11
Introduction to Permutations

Factorial

A factorial, denoted as n!, is the product of all positive integers up to n. It is a fundamental concept in combinatorics used to calculate permutations and combinations. For example, 5! equals 5 × 4 × 3 × 2 × 1 = 120. Understanding factorials is essential for solving problems involving arrangements and selections.
추천 영상:

Combinatorial Counting

Combinatorial counting involves determining the number of ways to choose or arrange items from a larger set. In this problem, we need to count the specific arrangements of the top three finishers from the total of 72 runners. This concept is crucial for solving problems in probability and statistics, especially when dealing with competitions or selections.
추천 영상:
가이드 코스
04:04
Fundamental Counting Principle