John has 5 friends who want to ride in his new car that can accommodate only 3 passengers at a time. How many different combinations of 3 passengers can be formed from the 5 friends?
A) 3
B) 8
C) 10
D) 15
E) 20
OA C
Source: GMAT Prep
John has 5 friends who want to ride in his new car that can accommodate only 3 passengers at a time. How many different
This topic has expert replies
-
- Moderator
- Posts: 6689
- Joined: 07 Sep 2017
- Followed by:21 members
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
Let's try as follows,BTGmoderatorDC wrote: ↑Mon Jun 27, 2022 12:04 amJohn has 5 friends who want to ride in his new car that can accommodate only 3 passengers at a time. How many different combinations of 3 passengers can be formed from the 5 friends?
A) 3
B) 8
C) 10
D) 15
E) 20
OA C
Source: GMAT Prep
There are only \(3\) places\(: + + + \)
But \(5\) friends that signifies \(2\) friends without places\(: x \, x\)
Hence we can represent\(: + + + \, x \, x \)
That is \(3!\) and \(2!\) our denominator
Total \(5\) friends or \(5!\) is a numerator
\(\dfrac{5!}{3!\cdot 2!} = 10\)
Hope it helps