I have two groups with n balls marked from 1 to n.
Two groups are randomized ( i.e. for each ball in each group to get any place in new order from 1 to n the probability is 1/n )
What the probability that in new order I won't see right combinations (1-1 or 2-2 , or 3-3 , or 4-4 ...)
Simple example :
Group 1 Group 2
Final order isn't good I don't want to see (1-1) .
Oct 3rd 2008, 09:05 AM
Do you know what a derangement of a queue of n objects is?
Derangements are permutations in which each member is active.
2143 is a derangement of 1234 whereas 2431 is not because the 3 is inactive.
If D(n) is the number of derangements on a queue of n objects;
Given any queue of the n balls from the first group, there are D(n) queues of the other group of balls that do not have any matching positions with the given queue.
Thus the answer to your question is .
Oct 4th 2008, 03:24 PM
Thank you very much fro your answer , Plato .
Let me to complicate my question .
I need to random the data such way that the probability that some will guess the right combination will be at most 1/k . Where k is number of similar values ( I have n/k groups).
Example (right combination) :
n=4 , k=2
The someone need to discover this order. Between first a-a and second a-a there is no difference (similar to b-b).
How I can random it ?
Oct 4th 2008, 03:44 PM
I am very sorry to say that I have no idea what you new question means!
Oct 4th 2008, 04:12 PM
Assume the right order is :
I give somebody these data :
What the probability that this somebody try any row ( assume first row a-b) and guess that it must be a-a . it seems 1/2 or 1/(n/k) in general ?