Given N objects from which to select K
sets then,

the number of combinations = N! / (K! (N -
K)!)

and

the number of permutations = N! / (N -
K)!

where permutations are those sets where
the order of the objects in a set is unique while combinations are the total
number of possible sets, regardless of object order.

WDA

end

----- Original Message -----

**Sent:** Sunday, April 29, 2001 8:57
PM

**Subject:** [lbnews] Mathematician
Needed

Does anyone know how to work out permutations? What I want to do is
calculate all the possible permutations of say, 6 numbers out of 7, 8, 9
and so on. Is there a standard formula or method that will do
this?

I can see that you could take the first six numbers and then drop each
number in turn, replacing it with one of the extra numbers in sequence, but I
how can you be sure that you have covered all possible combinations?

I'm not asking for the Basic code to do this - I can work that
out. What I need is just the method. Thanks in advance,

Derek

`To
unsubscribe send an email to: lbnews-unsubscribe@yahoogroups.com
`

`Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.`