I don't quite get what you mean, but the question asked,
In how many ways can five letters be chosen from the letters ARRANGE?
I think, I want 5 letters to be chosen from ARRANGE where order matters.
Problems in perms and combs are split into
selections and
arrangements.
Selections are divided into ordered and unordered, as well as with or without repetition. Arrangements are just determined with or without repetition. (See last year's 4U trial survival lectures for more information.) Sometimes, you only need to select people (e.g. four out of ten to have a meeting), but then you may need to arrange them (e.g. put those four people in a circle).
________________________________________________
The cases for this question are:
1. Two A's and two R's appear
2. One A's and two R's appear
3. Two A's and one R's appear
4. Two R's appear but no A's
5. Two A's appear but no R's
6. One of both A and R appear
(Not that any further cases are impossible, since we need a total of 5 letters)
If all we needed to do was to choose five letters, which actually implies
unordering, then there can only be \(3\) ways of attaining cases 1, 2 and 3, whilst there are \(6\) ways of attaining cases 4, 5 and 6. (This is because for cases 1, 2 and 3, we need to pick one more letter from {N,G,E}. Whereas for cases 4, 5 and 6 we need to pick two more from that set.)
Whereas if we had to arrange them as well, we would need more work.
Case 1: Multiply \(3\) to \( \frac{5!}{2!2!} \)
Case 2: Multiply \(3\) to \( \frac{5!}{2!} \)
Case 3: As with case 2
Case 4: Multiply \(6\) to \frac{5!}{2!} \)
Case 5: As with case 4
Case 6: Multiply \(6\) to \(5!\)
Note that we have multiplied the number of ways we can
choose the letters, to the number of ways we can then
arrange them to make words.