Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 25 Jun 2016, 02:01

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

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

# I know this is really simple but indulge me ok. I found this

Author Message
Intern
Joined: 29 Jun 2004
Posts: 19
Followers: 1

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

I know this is really simple but indulge me ok. I found this [#permalink]

### Show Tags

13 Oct 2004, 23:19
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

I know this is really simple but indulge me ok. I found this permuation problem at

http://cse.unl.edu/~rduell/assignments/countingTutorial/countingTutorial.html

Quote:
Example 2
How many bytes (a string of exactly 8 bits) contain exactly 5 zeros?

Here's the solution given :-

In this example note that the order selection of the bits that are a zero does not matter. Hence the postions of the zeroes in the byte form a 5 combination of the set of 8 elements. Thus the answer is C(8,5)=56.

Is there an easier way of understanding this ? Shouldn't it be a permutation problem ?
Director
Joined: 31 Aug 2004
Posts: 610
Followers: 3

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

### Show Tags

14 Oct 2004, 02:47
I think this is the best way to do it...
Intern
Joined: 29 Jun 2004
Posts: 19
Followers: 1

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

### Show Tags

14 Oct 2004, 05:09
Hi twixt,

Would it be possible for you to show me how it's done ?

Thanks,
Conal
Display posts from previous: Sort by