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?