Question

In how many ways can the letters in BEEKEEPER be rearranged so that two or more Es do not appear together?

(A) 1 (B)4 (C) 12 (D) 24 (E) 120​

Answer 1

The question is an illustration of permutation and factorials

The number of ways the letters in BEEKEEPER be rearranged so that two or more Es do not appear together is 2880

How to determine the number of arrangements

The word is given as:

BEEKEEPER

Remove the E's.

So, we have:

B K P R

The number of ways of arranging the above 4 letters is:

4!

Each of the 5 E's can stay in between adjacent letters, and they would not appear together.

The number of arrangement of the 5 E's is 5!

So, the total number of ways of arrangement is:

$n = 4! * 5!$

Evaluate the factorials

$n = 24 * 120$

Evaluate the product

$n = 2880$

Hence, the number of arrangement is 2880 (none of the options is correct)

Read more about permutation and factorials at:

https://brainly.com/question/11871015