Probability Midterm Question: Fruit row counting

DrAlexMV
Messages
24
Reaction score
0

Homework Statement



You have 10 pieces of fruits of which 1 is an orange, 1 is an apple, 1 is a pear, and 1 is a peach. How many ways are there to organize them in a row if the apples and oranges must be together and the pears and peaches cannot be together.

Homework Equations



Mostly factorials

The Attempt at a Solution



Total permutations = 10!
Ways oranges and apples are together = 2!9!
Ways peaches and pears cannot be together = 10! - 2!9!

Unfortunately, I did not know how to combine them so in a futile attempt to get credit I stated:

(10! - 2!9! + 2!9!)/(2!2!) = 10!/4

I am darn sure this is wrong. Could somebody enlighten me for the next time?
 
Physics news on Phys.org
Can you calculate the number of configurations where the apple and orange are together and the peach and the pear are together?
 
^ 8!2!2!

Right?
 
Agreed. So if you know how many configurations satisfy one constraint, and how many configurations satisfy that constraint but violate the second, what's the number you are looking for?

Edit: by the way, the question is not explicit on the point, but you appear to be assuming that the other six fruits are distinguishable - not all bananas, or something.
 
I am actually not sure how to combine these without counting things more twice. Could you aid me through that?
 
I suspect that the point you are missing is that the 8!2!2! are a subset of the 9!2!. Think of it this way - write every possible configuration on 10! pieces of paper, one per piece. Then split that pile in two according to whether or not the apple and orange are together. Then split the pile where they are together by whether or not the peach and pear are together. You know how many there were before that second split, and you know how many are in the wrong pile after. How many are in the right pile?
 
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