How many distinct ways can the word EVANESCENCE be arranged if the anagram must end with the letter E? hint... 10!/2!3!2! = 151,200

151200

Step-by-step explanation:

We can start by essentially taking off the E at the end, meaning that we want to find all the combinations of

EVANESCENC. We can do this because the combinations will have an E at the end by default.

To solve this, we have to figure out the amount of letters and the amount of each letter. There are 10 letters, with 3 E's, 2 C's, 2 N's, 1 S, 1 V, and 1 A. Using the formula , with n representing the amount of letters and each subset of n representing the amount of each letters, our answer is

3< x< 5

step-by-step explanation:

|x - 4| < 1

there are two solutions, one positive and one negative.   remember to flip the inequality when taking the negative solution

x-4 < 1       x-4 > -1

add 4 to each side

x-4+4 < 1+4       x-4+4 > -1+4

x< 5                 x> 3

3< x< 5

connie < felicia < stew

step-by-step explanation:

stew:

we need to find the slope

m = (y2-y1)/ (x2-x1)

    = (2650-795)/(10-3)

    = 1855/7

265 words per minute

connie:

we need to find the slope

m = (y2-y1)/ (x2-x1)

we have two points (0,0) and (4,800)

m = (800-0)/(4-0)

  m = 800/4

    200 words per minute

felicia:

260 words per minute

200< 260 < 265

connie < felicia < stew