Combinatorics problem - Permutations of ABDEFGH

Goldenwind
Messages
145
Reaction score
0
In theory I'm done this question, but would like to get it checked.

22) How many permutations of the letters ABCDEFGH contain
c) the strings BA and FGH?

Answer:

5 objects: BA, C, D, E, FGH.
Total: 5! = 120

This is following the example in the book. However, the example only has one cluster (Where a cluster is like BA, or FGH), and all of the book's clusters are in alphabetical order.

For something like this, where we have two clusters, and it's BA, not AB, does my method still work?
 
Physics news on Phys.org
That the order is alphabetical makes absolutely no difference. You knew that in your heart, right?
 
That's what I figured, hence how I got my answer, but just wanted to check to be sure.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top