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

It is currently 28 Jul 2016, 14:24
GMAT Club Tests

Close

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

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

The word NUGGET has six letters. What is the maximum # of

  post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
Manager
Manager
avatar
Joined: 20 Oct 2003
Posts: 63
Location: Houston, TX
Followers: 1

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

The word NUGGET has six letters. What is the maximum # of [#permalink]

Show Tags

New post 24 May 2004, 09:10
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

The word NUGGET has six letters.

What is the maximum # of different arrangement of character strings (e.g. GETNGU) one can make, ensuring that the two G letters are at least one letter apart?
CEO
CEO
avatar
Joined: 15 Aug 2003
Posts: 3460
Followers: 68

Kudos [?]: 818 [0], given: 781

Re: Comb/Perm [#permalink]

Show Tags

New post 24 May 2004, 10:14
jjomalls wrote:
The word NUGGET has six letters.

What is the maximum # of different arrangement of character strings (e.g. GETNGU) one can make, ensuring that the two G letters are at least one letter apart?


i might just screw this up..so study the solution and let me know.

1. find out number of arrangements of NUGGET ( no restrictions)

6!/2! is the total number of ways ( remember the signals problem, we have to divide by 2! to take care of the repitition of G)

2. find out ways that the two G's are ALWAYS together.

So, now we effectively have 5 letters because the two G's are always together. Total number of arrangements is simply 5!

3. subtract 2 from 1 , thats your answer

6!/2! - 5! = 360 - 120 = 240


how did i do? :oops:

Sincerely
Praet
SVP
SVP
User avatar
Joined: 30 Oct 2003
Posts: 1793
Location: NewJersey USA
Followers: 5

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

 [#permalink]

Show Tags

New post 24 May 2004, 19:05
Praetorian's solution is correct.
6!/2! - 5!
Senior Manager
Senior Manager
User avatar
Joined: 07 Oct 2003
Posts: 353
Location: Manhattan
Followers: 2

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

Re: Comb/Perm [#permalink]

Show Tags

New post 12 Jun 2004, 16:21
Praetorian wrote:
jjomalls wrote:
The word NUGGET has six letters.

What is the maximum # of different arrangement of character strings (e.g. GETNGU) one can make, ensuring that the two G letters are at least one letter apart?


i might just screw this up..so study the solution and let me know.

1. find out number of arrangements of NUGGET ( no restrictions)

6!/2! is the total number of ways ( remember the signals problem, we have to divide by 2! to take care of the repitition of G)

2. find out ways that the two G's are ALWAYS together.

So, now we effectively have 5 letters because the two G's are always together. Total number of arrangements is simply 5!

3. subtract 2 from 1 , thats your answer

6!/2! - 5! = 360 - 120 = 240


how did i do? :oops:

Sincerely
Praet


Could someone explain why is it that 5! indeed represents the number of ways to have 2 G's always together? any explanation would be greatly appreciated.
Manager
Manager
avatar
Joined: 02 Jun 2004
Posts: 154
Location: san jose,ca
Followers: 5

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

 [#permalink]

Show Tags

New post 12 Jun 2004, 17:55
lastochka,
just bundle the two G's together with a rope and now you have 5 items (E T N U and one bundle ).Arrangement of 5 items can be done in 5! ways (this is the basic theorem).

Hope this helps.

Agree with Praet's solution.
_________________

GS
No excuses - Need 750!!!

Manager
Manager
User avatar
Joined: 07 May 2004
Posts: 183
Location: Ukraine, Russia(part-time)
Followers: 2

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

Re: Comb/Perm [#permalink]

Show Tags

New post 13 Jun 2004, 03:48
jjomalls wrote:
The word NUGGET has six letters.

What is the maximum # of different arrangement of character strings (e.g. GETNGU) one can make, ensuring that the two G letters are at least one letter apart?


total # of combinations: 6!/2

GG****, *GG***, **GG**, ***GG*, ****GG are not allowed: 5*4!.

The answer is 6!/2 - 5*4! = 240.
Re: Comb/Perm   [#permalink] 13 Jun 2004, 03:48
Display posts from previous: Sort by

The word NUGGET has six letters. What is the maximum # of

  post reply Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

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®.