SOLUTION: How many permutations can be formed from the letters in the word BANANAS if each
arrangement must start and end with a n?
*use factorial notation to determine the number of permu
Algebra ->
Permutations
-> SOLUTION: How many permutations can be formed from the letters in the word BANANAS if each
arrangement must start and end with a n?
*use factorial notation to determine the number of permu
Log On
Question 1043289: How many permutations can be formed from the letters in the word BANANAS if each
arrangement must start and end with a n?
*use factorial notation to determine the number of permutation.
BANANAS
They must all start and end with N like this:
NBAAASN
This amounts to getting the number of distinguishable
arrangements of BAAAS to place between the two N's.
Since there are three indistinguishable A's in BAAAS, it's
ways:
Edwin
