Garry Bettle wrote:
> On 5/21/07, Paul Newton wrote:
>
>> No takers ? OK is there a general solution to this type of problem:
>>
>> Four counters (Red, Green, Blue, Yellow)
>> 24 distinct ways of arranging them.
>> 1 correct arrangement (say Red, Green, Blue, Yellow)
>> How are the incorrect arrangements distributed (what is the probablity
>> distribution of the incorrect arrangements) based on numer of counters
>> in the wrong position ?
>>
>> For five counters ?
>>
>> For n counters ?
>>
>
> Does this help?*:
>
> "
> n! different ways of arranging n distinct objects in a sequence. (The
> arrangements are called permutations.) And the number of ways one can
> choose k objects from among a given set of n objects (the number of
> combinations), is given by the so-called binomial coefficient:
>
> {n choose k} = n!\k!(n-k)!
> "
>
> Garry
>
> * - http://en.wikipedia.org/wiki/Factorial
Whilst those concepts/formaulas are needed to solve the problem, the
solution to the problem is much more involved and (IMHO) non-trivial.
See http://www.ds.unifi.it/VL/VL_EN/urn/urn6.html and
http://en.wikipedia.org/wiki/Rencontres_numbers
_______________________________________________
Post Messages to: [email protected]
Subscription Maintenance: http://leafe.com/mailman/listinfo/profox
OT-free version of this list: http://leafe.com/mailman/listinfo/profoxtech
Searchable Archive: http://leafe.com/archives/search/profox
This message: http://leafe.com/archives/byMID/profox/[EMAIL PROTECTED]
** All postings, unless explicitly stated otherwise, are the opinions of the
author, and do not constitute legal or medical advice. This statement is added
to the messages for those lawyers who are too stupid to see the obvious.
