Last visit was: 25 Apr 2026, 08:23 It is currently 25 Apr 2026, 08:23
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.
Close
Request Expert Reply
Confirm Cancel
User avatar
jjomalls
Joined: 20 Oct 2003
Last visit: 31 Dec 2004
Posts: 59
Own Kudos:
Location: Houston, TX
Posts: 59
Kudos: 3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Praetorian
Joined: 15 Aug 2003
Last visit: 27 Dec 2017
Posts: 2,867
Own Kudos:
Given Kudos: 781
Posts: 2,867
Kudos: 1,728
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
anandnk
Joined: 30 Oct 2003
Last visit: 30 Nov 2013
Posts: 893
Own Kudos:
Location: NewJersey USA
Posts: 893
Kudos: 425
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
lastochka
Joined: 07 Oct 2003
Last visit: 15 Aug 2006
Posts: 193
Own Kudos:
Location: Manhattan
Posts: 193
Kudos: 71
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Praetorian
jjomalls
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.
User avatar
GoalStanford
Joined: 02 Jun 2004
Last visit: 26 Jan 2005
Posts: 96
Own Kudos:
Location: san jose,ca
Posts: 96
Kudos: 27
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
User avatar
Emmanuel
Joined: 07 May 2004
Last visit: 26 Jul 2004
Posts: 104
Own Kudos:
Location: Ukraine, Russia(part-time)
Posts: 104
Kudos: 23
Kudos
Add Kudos
Bookmarks
Bookmark this Post
jjomalls
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.



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!