Re: permutations?

• To: mathgroup at smc.vnet.net
• Subject: [mg46469] Re: permutations?
• From: "Amir" <z64043 at netscape.net>
• Date: Fri, 20 Feb 2004 00:29:14 -0500 (EST)
• References: <c11sc1\$n64\$1@smc.vnet.net>
• Sender: owner-wri-mathgroup at wolfram.com

```Use the built-in function "Permutations"

Permutations[{a,b,c,d,a1,b1,c1,d1}]

Speicher

"sean kim" <sean_incali at yahoo.com> wrote in message
news:c11sc1\$n64\$1 at smc.vnet.net...
> I think this is a permutation problem. but i'm not sure. do correct
> me.
>
> let's say you have...
>
> a, b, c, d, e   and...
>
> a', b', c', d', e'
>
> what are the possible combination will go from a( or a' ) to e ( or
> e')
>
> so that you get...
>
> {a b c d e}, {a b c d e'}, {a b c d' e}, {a b c d' e'}, {a b c' d e},
> { a b c' d' e}, {a, b, c' d e'}, {a, b, c' d' e'}....so on
>
> I have 32 from doing it the brute force way by hand.  how do i do that
> with Mathematica? I don't think it's fully connected graph.  because a
only
> connects to downstream b or b'
>
> also... what kinda problem is described above?
>
> Thank you all very much in advance for any thoughts and comments.
>
> sean
>

```

• Prev by Date: Re: Re: output in NMinimize on each step?
• Next by Date: Re: Help!!!!
• Previous by thread: Re: permutations?
• Next by thread: Re: permutations?