From: David Mertz <voting-project_at_gnosis_dot_cx>

Date: Fri Apr 30 2004 - 11:55:53 CDT

Date: Fri Apr 30 2004 - 11:55:53 CDT

On Apr 29, 2004, at 2:10 PM, Matteo Giacomazzi wrote:

*> DL> Sorry I'm not sure I understand =). What do you mean by partial
*

*> DL> permutations?
*

*>
*

*> Should be Combinatorial Calculus: you should compute the number of
*

*> combinations of M elements in class N for each N in [1..M].
*

*> The resulting formula is the one given by David a few posts ago! :)
*

This may be a translation thing, but in (mathematical) English we

distinguish between Combinations and Permutations.

A Combination is "How many ways can you select N items from a bag of M

items (without regard to the resulting order of the N choices)?"

A Permutation is "In how many orders can you select N items from a bag

of M items?" This is larger than the number of Combinations.

For ranked preference, we're talking about (sums of) permutations, as

my formula and table indicated.

Yours, David...

--- Dred Scott 1857; Santa Clara 1876; Plessy 1892; Korematsu 1944; Eldred 2003 ================================================================== = The content of this message, with the exception of any external = quotations under fair use, are released to the Public Domain ==================================================================Received on Fri Apr 30 23:17:26 2004

*
This archive was generated by hypermail 2.1.8
: Fri Apr 30 2004 - 23:17:29 CDT
*