Drsoccerball
Well-Known Member
- Joined
- May 28, 2014
- Messages
- 3,650
- Gender
- Undisclosed
- HSC
- 2015
Re: 2015 permutation X2 marathon
is everyone elses latex screwing up?
is everyone elses latex screwing up?
I can see your answer when I "reply with quote".is everyone elses latex screwing up?
Sorry, but it was in a multiple choice that we got today in school. The choices were: 44100, 22050, and two other ones in the ten thousands but I can't remember themCould you provide the answer for us to check?
Possible arrangements are : 4,4,2 and 4,3,3 (which obviously can be arranged)new q:
There are 10 people, and three rooms A, B, C. How many ways can all these ten people accommodate these rooms such that each room can only have a maximum of 4 people?
not sure of the answer but I got: 44100
Thats what i thought but remember multiple choice question 10 in or paper both were rightI don't think you should divide by 2! because they are distinct rooms labelled A, B, and C
You would only divide by like 3! if a question said: how many ways can 3 pairs of people up to play a game, right? as opposed to how may ways can you pick 3 pairs of people?I don't think you should divide by 2! because they are distinct rooms labelled A, B, and C
No the reason why I divided by 2! for that question was because I assumed the tables were identical. However in this question, the rooms are distinct, so you don't divide.Thats what i thought but remember multiple choice question 10 in or paper both were right
But as ekman mentioned the rooms are not identical ? Therefore 4 in one room and 4 in the other is different to another 4 in one room and another 4 in the other?You divide by 2! to make sure you're not overcounting the no. of ways to form the two groups of 4 in 4, 4, 2 and the two groups of 3 in 4, 3, 3.
To form the groups of course, but when you put them into distinct rooms, having 4 people in room A and having 4 people in room B, and having them switch are two different arrangements, as 4 that were initially in A are now in B, and vice versa.You divide by 2! to make sure you're not overcounting the no. of ways to form the two groups of 4 in 4, 4, 2 and the two groups of 3 in 4, 3, 3.
The answer for anyone who wants to peek: 1 - n! / (n^n)new q:
There are 'n' cars in a parking lot with 'n' exits. Any car can go into any exit. What is the probability that there is at least one exit which is not accessed by any car?
Again, don't have the solution to this
lol mine's way off. I did 1 - (n-1)^n / n^(n-1)The answer for anyone who wants to peek: 1 - n! / (n^n)
See what happens with your answer when n=4.lol mine's way off. I did 1 - (n-1)^n / n^(n-1)
The probability they all go through one door is actually 1 / [n^(n-1)]Probability of all cars going into one door = 1/n^n
Therefore 1- probability of each car going through a different gate: 1-(n!/n^n)