how many words can be formed using all letters in the word EXAMINATION

Question

Assuming any sequence of letters is a word, how many words can we form in such a way that the first two letters are different consonants while the last two letters are vowels?

Answer 1

from itertools import *

vows = ('E', 'A', 'I', 'O')
cons = ('X', 'M', 'N', 'T', 'S')
count = 0

for m in permutations(list('EXAMINATIONS')):
    #print(m)
    if m[0] != m[1] and m[0] in cons and m[1] in cons and m[10] in
        vows and m[11] in vows:
        count += 1

print(count)

The answer is 33868800 if the program is correct. It is very much unoptimized.

Answer 2

A beginning:

There is no single formula for this. Therefore we have to organize the different types of cases, to which then known formulas apply.

There are $11$ slots where we have to write a letter. How many choices are there for the first two letters? They are of two different types, because of the double N. How many choices are there for the last two letters. Again there are different types.

Finally we have to fill in ("permute") the seven intermediate letters. There are no restrictions, but according to the types identified before the count will be different.

Answer 3

To solve this, we need to consider 3 cases:

1. $N$ is in the first two letters.
2. $E$ is in the last two letters.
3. $I$ is in the last two letters.

To make it easier for my typing, let the propositions above be represented by the 3-tuple. e.g. $(T, T, T)$ means all propositions are true, $(F, F, F)$ means all propositions are false.

The following are the computations:

1. $(F, F, F)$
   Since $N, E, I$ are all in the middle, we have 3 pairs of repetitions. To account for repetitions, the method used for counting is $$P([n_1,n_2,\dots,n_k], n) = \dfrac{n!}{n_1!n_2!\dots n_k!}$$ Where $n$ is the number of objects overall (including repetitions). And the $n_1, n_2, \dots, n_k$ are the repetition count. I will refer to this via $P([n_1,n_2,\dots,n_k], n)$ from now on.
   The number of words when all proposition are false are then, $$C_{first}*C_{last}*C_{middle}$$$${{4}\choose{4-2}}{{6}\choose{6-2}}P([2, 2, 2], 7) = 226, 800 $$Since I've laid out all the tools you need, from now on its just cold heart computation.

2. $(F, F, T)$ $${{4}\choose{4-2}}{{6}\choose{6-2}}P([2, 2], 7) = 453, 600 $$

3. $(F, T, F)$ $${{4}\choose{4-2}}{{6}\choose{6-2}}P([2, 2], 7) = 453, 600 $$

4. $(F, T, T)$ $${{4}\choose{4-2}}{{6}\choose{6-2}}P([2], 7) =907,200$$

5. $(T, F, F)$ $${{4}\choose{4-2}}{{6}\choose{6-2}}P([2, 2], 7) =453, 600$$

6. $(T, F, T)$ $${{4}\choose{4-2}}{{6}\choose{6-2}}P([2], 7) =907,200$$

7. $(T, T, F)$ $${{4}\choose{4-2}}{{6}\choose{6-2}}P([2], 7) =907,200$$

8. $(T, T, T)$ $${{4}\choose{4-2}}{{6}\choose{6-2}}7!=1,814,400$$

Adding them all up, we get $6,124,800$, accounting for $3$ pairs of repetition.

Answer 4

how many words can be formed using all letters in the word EXAMINATION

Assuming any sequence of letters is a word, how many words can we form in such a way that the first two letters are different consonants while the last two letters are vowels?

Assuming each letter is used only as many times as it occurs in the word.

First count the ways to place vowels and consonants, without considering identity or order within their type.

In addition to the two places on each ends, reserved for two consonants and two vowels respectively, there are seven places in the middle of the arrangement, which can hold three consonants and four vowels in $\frac{7!}{3!4!}$ ways.

$$\oplus\oplus\,\underbrace{\oplus\oplus\oplus\otimes\otimes\otimes\otimes}_{\frac{7!}{3!4!}\text{ permutations}}\,\otimes\otimes$$

Next count the ways to fill those places.

The consonants: XMTNN, can be arranged in $\frac{5!}{2!}-3!$ distinct permutations such that the pair of N do not simultaneously occupy the first two positions.

The vowels: EOAAII can be arranged in $\frac{6!}{2!2!}$ distinct permutations. If the vowels in the last two places have to be distinct this would be $\frac{6!}{2!2!}-2\times\frac{4!}{2!}$ permutations.

Thus there are $\frac{7!}{4!3!}\!\!\left(\frac{5!}{2!}-3!\right)\!\!\left(\frac{6!}{2!2!}\right)$ ways to arrange the letters as specified. ($340,200$)

There are $\frac{7!}{4!3!}\!\!\left(\frac{5!}{2!}-3!\right)\!\!\left(\frac{6!}{2!2!}-2\times\frac{4!}{2!}\right)$ ways if the vowels in the last two places have to be distinct. ($294,840$)