It is currently 19 Sep 2017, 19:23

### GMAT Club Daily Prep

#### 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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# There are 3 states and 3 students representing each state.

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
TAGS:

### Hide Tags

Manager
Joined: 29 Dec 2009
Posts: 114

Kudos [?]: 26 [0], given: 10

Location: india
There are 3 states and 3 students representing each state. [#permalink]

### Show Tags

14 Apr 2010, 05:29
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 1 sessions

### HideShow timer Statistics

There are 3 states and 3 students representing each state. In how many ways can 5 students be chosen such that at Least one student is chosen from each state.

Kudos [?]: 26 [0], given: 10

Math Expert
Joined: 02 Sep 2009
Posts: 41601

Kudos [?]: 124048 [2], given: 12070

Re: tough p n c [#permalink]

### Show Tags

14 Apr 2010, 06:14
2
This post received
KUDOS
Expert's post
jatt86 wrote:
1) There are 3 states and 3 students representing each state. In how many ways can 5 students be chosen such that at least one student is chosen from each state.

To choose 5 students so that atleast one student will represent each state can be done in two ways:

A. 3-1-1 (3 students from 1 state and 1 student from other two states)
3C1*3C3*3C1*3C1=27
3C1 - # of ways to choose 3-student state;
3C3 - # of ways to choose 3 students from 3-student state;
3C1 - # of ways to choose 1 student from the first 1-student state;
3C1 - # of ways to choose 1 student from the second 1-student state.

OR
B. 1-2-2 (1 student from 1 state and 2 students from other two states)
3C1*3C1*3C2*3C2=81
3C1 - # of ways to choose 1-student state;
3C1 - # of ways to choose 1 student from the 1-student state;
3C2 - # of ways to choose 2 students from the first 2-student state;
3C2 - # of ways to choose 2 students from the second 2-student state.

27+81=108.

Answer: 108.
_________________

Kudos [?]: 124048 [2], given: 12070

Intern
Joined: 07 Apr 2010
Posts: 23

Kudos [?]: 11 [0], given: 32

Re: tough p n c [#permalink]

### Show Tags

15 Apr 2010, 22:23
It's necessary that 1 student is selected from each state.
So number of ways 1 student can be selected from 1 state = 3.
So number of ways 1 student can be selected from each of the 3 state is 3*3*3 = 27.

3 of the 9 have now been selected and 6 remain; out of which 2 need to be selected.
This can be done in 6C2 ways.

So the answer is 27*6C2 = 405
If the 5 people were to be selected for 5 different posts, then the answer would be 405*5!
_________________

In a Normal Distribution, only the Average 'Stand Out'

Kudos [?]: 11 [0], given: 32

Math Expert
Joined: 02 Sep 2009
Posts: 41601

Kudos [?]: 124048 [0], given: 12070

Re: tough p n c [#permalink]

### Show Tags

16 Apr 2010, 04:17
lprassanth wrote:
It's necessary that 1 student is selected from each state.
So number of ways 1 student can be selected from 1 state = 3.
So number of ways 1 student can be selected from each of the 3 state is 3*3*3 = 27.

3 of the 9 have now been selected and 6 remain; out of which 2 need to be selected.
This can be done in 6C2 ways.

So the answer is 27*6C2 = 405
If the 5 people were to be selected for 5 different posts, then the answer would be 405*5!

Above solution is not correct. There will be duplications in it. Let's see this on another example: two states 3 from each. We should choose 3 students so that atleast one will be from each state.

State 1: A, B, C
State 2: X, Y, Z

According to the above solution answer should be 3C1*3C1*4C1=36.

But actual groups are:
ABX;
ABY;
ABZ;

ACX;
ACY;
ACZ;

BCX;
BCY;
BCZ;

XYA;
XYB;
XYC;

XZA;
XZB;
XZC;

YZA;
YZB;
YZC.

Total 18 groups.

According to my solution: one pattern 1-2 --> 2C1(choosing which state will provide with one student)*3C1*(choosing this one student from 3)*3C2(choosing 2 student from another state)=2*3*3=18 (correct answer).

Hope it's clear.
_________________

Kudos [?]: 124048 [0], given: 12070

Manager
Joined: 24 Mar 2010
Posts: 78

Kudos [?]: 15 [1], given: 9

Location: Mumbai, India
Schools: INSEAD - dinged; IE-admit; ISB - admit; IIMB-admit; SPJain- admit; IIM C- Admit, IIM A - Dinged after interview. Finally joining IIM B
WE 1: 3
WE 2: 2
WE 3: 2
Re: tough p n c [#permalink]

### Show Tags

16 Apr 2010, 08:06
1
This post received
KUDOS
DEAR MODERATOR,
not understood.

I think:
One from each of 3 states ( havin 3 st each) - 3c1*3c1*3c1 + 6c2 shd be the answer.
_________________

ASHISH DONGRE
BE KIND & GENEROUS TO SHARE THE KUDOS...THE MORE YOUR GIVE THE MORE YOU GET

Kudos [?]: 15 [1], given: 9

Intern
Joined: 07 Apr 2010
Posts: 23

Kudos [?]: 11 [0], given: 32

Re: tough p n c [#permalink]

### Show Tags

16 Apr 2010, 08:18
I think meghash3 is right. Thanks for pointing out.
I screwed it up by multiplying 27 and 6C2.
It should be 27 + 6C2

Could the moderator kindly point out the fault in this approach, if any?
_________________

In a Normal Distribution, only the Average 'Stand Out'

Kudos [?]: 11 [0], given: 32

Intern
Joined: 27 Jul 2008
Posts: 9

Kudos [?]: [0], given: 3

Re: tough p n c [#permalink]

### Show Tags

16 Apr 2010, 13:56
5 slots to choose.

(3C2 * 3C2 * 3C1) --> 2 from state 1, 2 from state 2, 1 from state 3.
= 27.

We need to account for possibilities where we choose 1 from state 2, and 1 from state 1.
Therefore, 3*27 = 81.

3C3 * 3C1 * 3C1 --> 3 from state 1, and 1 each from the remaining states.
= 9.
As above, account for the other two possibilities.
Therefore, 3*9 = 27.

Total = 108.

Kudos [?]: [0], given: 3

Intern
Joined: 07 Apr 2010
Posts: 23

Kudos [?]: 11 [0], given: 32

Re: tough p n c [#permalink]

### Show Tags

17 Apr 2010, 05:55
Total number of possibilities $$= 9C5 = 9C4 = \frac{9*8*7*6}{4*3*2} = 126$$
From this we need to subtract the possibilities where the 5 students are chosen solely among the other 2 states. This can be done in $$3*6C5 = 3*6C1 = 18 ways$$
So $$126 - 18 = 108 ways$$
_________________

In a Normal Distribution, only the Average 'Stand Out'

Kudos [?]: 11 [0], given: 32

Intern
Joined: 23 Feb 2014
Posts: 1

Kudos [?]: [0], given: 12

Re: There are 3 states and 3 students representing each state. [#permalink]

### Show Tags

31 Aug 2014, 00:23
lprassanth wrote:
Total number of possibilities $$= 9C5 = 9C4 = \frac{9*8*7*6}{4*3*2} = 126$$
From this we need to subtract the possibilities where the 5 students are chosen solely among the other 2 states. This can be done in $$3*6C5 = 3*6C1 = 18 ways$$
So $$126 - 18 = 108 ways$$

This method seems to work for me.

Kudos [?]: [0], given: 12

Re: There are 3 states and 3 students representing each state.   [#permalink] 31 Aug 2014, 00:23
Similar topics Replies Last post
Similar
Topics:
11 Mr. Evans will states that each of his children will receive 7 26 Aug 2016, 04:02
14 In a state school. a student secures an 'overall distinction 13 28 Jul 2016, 09:46
4 On a test, students receive 3 points for each correct answer and are p 4 28 Apr 2017, 05:45
1 Given that x^3*y > 0 and that x^2*y^3 < 0 which of the following state 4 24 Jun 2017, 02:41
71 In a meeting of 3 representatives from each of 6 different companies, 8 23 May 2017, 17:21
Display posts from previous: Sort by

# There are 3 states and 3 students representing each state.

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.