Math problem

[Slick]

I didn't read all the replies, so pardon this if already stated, but aren't you talking about the statistical formula for combinations? Mathematically, it means: how many ways can I group n things in groupings of r where the order of grouping is not important. (There is a separate formula for permutations where order is important)

The general formula for C(n,r) = n!/[r!(n-r)!]

Where the number of combinations C(n,r) is a function of the total number of people n taken r at a time.

You don't need any particular number of players to start with. If n = 10 and r = 3 then the required number of games is 10!/[3!x7!] = 120

Exactly how to arrange the people in each game is most easily worked out by hand although I suppose it could be done with a program.

Slick.