Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

A group of 8 friends want to play doubles tennis. How many different ways can the group be divided into 4 teams of 2 people?

A. 420 B. 2520 C. 168 D. 90 E. 105

8c2 x 6c2 x 4c2 = 2520 = B

We should divide this by 4! --> 2520/4!= 105, as the order of the teams does not matter.

You can think about this in another way. For the first person we can pick a pair in 7 ways; For the second one in 5 ways (as two are already chosen); For the third one in 3 ways (as 4 people are already chosen); For the fourth one there is only one left.

1. The number of ways in which \(mn\) different items can be divided equally into \(m\) groups, each containing \(n\) objects and the order of the groups is not important is \(\frac{(mn)!}{(n!)^m*m!}\).

2. The number of ways in which \(mn\) different items can be divided equally into \(m\) groups, each containing \(n\) objects and the order of the groups is important is \(\frac{(mn)!}{(n!)^m}\)

A group of 8 friends want to play doubles tennis. How many different ways can the group be divided into 4 teams of 2 people?

A. 420 B. 2520 C. 168 D. 90 E. 105

We should divide this by 4! --> 2520/4!= 105, as the order of the teams does not matter.

You can think about this in another way. For the first person we can pick a pair in 7 ways; For the second one in 5 ways (as two are already chosen); For the third one in 3 ways (as 4 people are already chosen); For the fourth one there is only one left.

1. The number of ways in which \(mn\) different items can be divided equally into \(m\) groups, each containing \(n\) objects and the order of the groups is not important is \(\frac{(mn)!}{(n!)^m*m!}\).

2. The number of ways in which \(mn\) different items can be divided equally into \(m\) groups, each containing \(n\) objects and the order of the groups is important is \(\frac{(mn)!}{(n!)^m}\)

I tried using the formula and got:

m = 4 groups n = 8 people

(4*8)!/(8!)^4*4! but the result was way off.

Am I using it wrongly?

Appreciate the help.

The number of ways in which \(mn\) different items can be divided equally into \(m\) groups, each containing \(n\) objects and the order of the groups is not important is \(\frac{(mn)!}{(n!)^m*m!}\).

How many different ways can the group be divided into 4 teams (m) of 2 people (n)?

Re: A group of 8 friends want to play doubles tennis. How many
[#permalink]

Show Tags

16 Jun 2016, 23:44

For the first 2 people can be choosen out of 8 people,for the second team 2 people out of 6 people,for the third team 2 people out of 4 people and for the last team 2 people out of 2 and since the order of the team doesn’t matter,so we will divide it by 4!( if the teams are T1,T2,T3 and T4,then arrangement as T1 T2 T3 T4 or T4 T2 T3 T1 is the same) 8c2*6c2*4c2*2c2/4!=105

Re: A group of 8 friends want to play doubles tennis. How many
[#permalink]

Show Tags

19 Aug 2016, 14:45

In case that the teams were DISTINCT i.e. {A,B}, {C,D}, {E,F}, {G,H} is NOT the same set as: {E,F}, {C,D}, {A,B}, {G,H} how the question would be written ?

A group of 8 friends want to play doubles tennis. How many
[#permalink]

Show Tags

10 Dec 2017, 11:06

1

Top Contributor

Balvinder wrote:

A group of 8 friends want to play doubles tennis. How many different ways can the group be divided into 4 teams of 2 people?

A. 420 B. 2520 C. 168 D. 90 E. 105

Let the 8 people be: A, B, C, D, E, F, G, and H

Take the task of creating the teams and break it into stages.

Stage 1: Select a partner for person A There are 7 people to choose from, so we can complete stage 1 in 7 ways

ASIDE: There are now 6 people remaining. Each time we pair up two people (as we did in stage 1), we'll next focus on the remaining person who comes first ALPHABETICALLY. For example, if we paired A with B in stage 1, the remaining people would be C, D, E, F, G and H. So, in the next stage, we'd find a partner for person C. Likewise, if we paired A with E in stage 1, the remaining people would be B, C, D, F, G and H. So, in the next stage, we'd find a partner for person B. And so on...

Stage 2: Select a partner for the remaining person who comes first ALPHABETICALLY There are 5 people remaining, so we can complete this stage in 5 ways.

Stage 3: Select a partner for the remaining person who comes first ALPHABETICALLY There are 3 people remaining, so we can complete this stage in 3 ways.

Stage 4: Select a partner for the remaining person who comes first ALPHABETICALLY There is 1 person remaining, so we can complete this stage in 1 way.

By the Fundamental Counting Principle (FCP), we can complete all 4 stages (and thus create 4 pairings) in (7)(5)(3)(1) ways (= 105 ways)

Answer: E

Note: the FCP can be used to solve the MAJORITY of counting questions on the GMAT. So, be sure to learn it.