A team of explorers are going to randomly pick 4 people out of 10 to go into a maze. How many different ways are there to pick?
Then the 4 chosen ones are going to be separated into 4 different corners: North, South, East, West. How many ways can they be separated?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
When you pick 4 out of 10 people, the order does not matter (whether Bob, Allen, Dick, Ethan go is the same as Ethan, Allen, Dick, or Bob so it does not matter if Bob is position 1 or position 4) so you need to use the formula for combinations, which is (n!) / (k! * (n-k)!) which is (10!) / (6!) * (4!). Once you simplify, the answer is 210. (We assume they're all picked together, versus being picked one by one so that the pool of choices decreases after each pick, which would be a permutation formula and order would matter).
For the second part of the question, the order does matter since each location is different - position 1, 2, 3, 4 - north, south, east, west. Bob in the north corner (position 1) is different from him being in the east corner (position 3). So here, we need to use a permutation formula, which is (n!) / (n-k)! so n=4 positions or choices and we have 4 people to arrange, k=4, and when you simplify, you get 4! which is 24.