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

answer:

(-8,7)

explanation:

we know that  

f

(

−

3

)

=

7

therefore, if we wish to get the output as 7, in the function, we need to have our input to be -3.

looking at the function  

f

(

x

+

5

)

, what should the value of x be, such that the input in the function becomes 7?

we simply equate the terms,

x

+

5

=

−

3

x

=

−

8

thus, the point on the new function would be  

(

−

8

,

7

)

step-by-step explanation: