Yes, depends on what he was making?
The question is really incomplete.
Answer:
Step-by-step explanation:
In a word where no letters are repeated, such as FRANCE, the number of distinguishable ways of arranging the letters could be calculated by 5!, which gives 120. However, when letters are repeated, you must use the formula
n
!
(
n
1
!
)
(
n
2
!
)
...
Explanation:
There are 4 s's, 3 a's and a total of 9 letters.
9
!
(
4
!
)
(
3
!
)
=
362880
24
×
6
= 2520
There are 2520 distinguishable ways of arranging the letters.
Practice exercises:
Find the number of distinguishable ways of arranging the letters in the word EXERCISES.
Find the number of distinguishable ways of arranging letters in the word AARDVARK.
1) -3
2) -5
3) -7
4) -9
Explanation:
Arithmetic Sequence Formula
a(n) = a1 + (a - 1) (d)
a= term position
a(n)= nth term
a1= first term