How many ways can we rearrange the letters in DISCRETE

  • Thread starter ZombiesFTW
  • Start date
Hey, new member here. Been viewing this forums for a long time now and used this forum as a resource for help with homework.

Anyways, wasn't sure where to put this problem. I am having trouble setting up the problem.

How many ways can we rearrange the letters in DISCRETE so that the E’s are adjacent and the
first letter precedes the last letter in the standard alphabetical order (e.g. DISCREET is ok, but
TISCREED is not).

I am trying to solve it by realizing there are 8 spaces in that word. Then how many different places can I place the E's so then that would be something like this:

_ _ _ _ _ _ _ _
Add up each row's product and that would be the answer.

Is this the best way to go about solving this? Or is there an easier way?
I think the easiest way to do it is consider the two E's as a single letter thus your words are built from D I S C R EE T - thus you have 7 distinct "letters".

As for have the ordering between the first and last letter, you can ignore this and calculate all possible words then divide by 2 to only consider the correct order. The reason for this factor of two is that all words come in pairs: A word and its reverse. Only one of these will have the ordering between the first and last letter you want.
So then would the answer be 7! / 2?


Would it be (7! * 7) / 2

Since it would be
7! * 7
then divide by two since the order would only work one way.
Last edited:
7!/2 is correct, I don't quite understand how you got 7*7!

Physics Forums Values

We Value Quality
• Topics based on mainstream science
• Proper English grammar and spelling
We Value Civility
• Positive and compassionate attitudes
• Patience while debating
We Value Productivity
• Disciplined to remain on-topic
• Recognition of own weaknesses
• Solo and co-op problem solving

Hot Threads