Simplified form for sum of permutations ? Combinitorics question
- From: joe <joeycook@xxxxxxxx>
- Date: 24 Oct 2007 10:08:26 -0700
I have been beating my head against the wall, because I know there
must be a simplified generalized formula for what I want to do.
If I have a group of values, say a,b,c,d
I want to sum the product of all these permutations. basically:
ab+ac+ad+bc+bd+cd, which is 11 math operations
which I think is best simplified as (a+b)(c+d) + ab + cd (7 math
operations)
Or perhaps:
ab + (a+b)c + (a+b+c)d, which can also be thought of as 7 operations.
But, what is the general form when the I want to chose 3 out of my
four values (abc+abd+bcd), or groups of 10 out of 100 total, etc?
Thanks
.
- Prev by Date: Re: smallest positive integer that has exactly k divisors
- Next by Date: Re: JSH: Would anything matter?
- Previous by thread: Re: Simplified form for sum of permutations ? Combinitorics question
- Next by thread: Simplified form for sum of permutations ? Combinitorics question
- Index(es):
Relevant Pages
|