Re: Help with Permutations
- From: "M.A.Fajjal" <h2maf@xxxxxxxxx>
- Date: Sat, 07 Jan 2006 10:04:46 EST
> Thanks for your input. You are correct, I require a
> formula to
> calculate the subset of permutations according to the
> rules above. I
> say the subset of 'permutations' because different
> orderings of the
> same letters are part of the output required:
>
> e.g. "abb" will include "bb" in its output, but only
> once. It will also
> include both "ab" and "ba" in its output.
>
> It is just where a result that has already been
> outputted once before
> that it will not be generated; and I need to be able
> to calculate the
> number of results that will be outputted (as outlined
> above) *before* I
> run the algorithm.
>
> Could anyone help me with the formula?
>
A simple program can be designed to get the permutations for each length for any expression
for 'acccdde' permutations shall be
4+14+43+114+250+420+420= 1265
P(L1)=4
P(L2)=14
P(L3)=43
P(L4)=114
P(L5)=250
P(L6)=420
P(L7)=420
.
- References:
- Re: Help with Permutations
- From: barliow
- Re: Help with Permutations
- Prev by Date: Re: Q:About primes?
- Next by Date: Re: Help with Permutations
- Previous by thread: Re: Help with Permutations
- Next by thread: Re: Help with Permutations
- Index(es):
Relevant Pages
|