- #1

- 6

- 0

## Main Question or Discussion Point

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:

_ _ _ _ _ _ _ _

8*8*6*5*4*3*2*1

6*8*8*5*4*3*2*1

.

.

.

.

.

+_________________

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?

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:

_ _ _ _ _ _ _ _

8*8*6*5*4*3*2*1

6*8*8*5*4*3*2*1

.

.

.

.

.

+_________________

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?