Simple combination problem( arranging objects in rows)

  • Thread starter Thread starter torquerotates
  • Start date Start date
  • Tags Tags
    Combination
torquerotates
Messages
207
Reaction score
0

Homework Statement

there are 3 girls and 3 boys that are to sit in a row. How many ways are there for them to sit in a row if the boys must sit together?

Homework Equations

n!=n(n-1)(n-2)...(3)(2)(1)

The Attempt at a Solution



there are 4 possible positions for the boys. o 1 o 1 o 1 o

the o's represent the group of 3 boys and the 1's each represent a girl. Within a o, there are 3! ways to arrange boys. And since there are 4 o's, there are 4! ways of arranging the o's. Just looking at the o's, we have, by counting, (3!)(4!) ways of arranging the boys. And since there are 3 1's, there are 3! ways of arranging the girls. The solution by counting is that there are (3!)(4!)(3!) ways for the boys and girls to be arranged in a row.

But the book has it at (3!)(4!). Did I do something wrong?
 
Physics news on Phys.org
Only one of your o's contains any boys in any given seating arrangement. Why are you counting different arrangements of the o's??
 
because first I fix a o. Within that o, there are 3! ways to rearrange the boys. There are also 4! ways rearranging the o within the fixed 3 girls. But there are also 3! ways of rearranging the girls.
 
You said there were 4 positions the boys could occupy. Not 4!. Three of the o's are empty in any given arrangement. Not much point in rearranging those.
 
oh, I get it( stupid me). So 3! ways of rearranging the boys in each o and 4 ways of rearranging the o's and 3! ways of rearranging the girls give rise to 3!4!?
 
That's it.
 
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