Combination of text in all possible orders

[amirsalamat]

Hi everyone,
I have a set of n number of names (e.g. Alex, Bruce, Steve, Rob,....) and I want to make a 3 word combination of all possible configurations with one name being in all combinations. In the below example Alex is a text present in all combinations:

Alex Bruce Steve
Alex Steve Bruce
Steve Alex Rob
Alex Rob Bruce

Thank you! In Advance

[newdoverman]

How many names are you going to have in total? Even without counting the reversal of names, the number of sets of 3 is going to get very large very quickly. The basic formula to calculate the number of sets for 3 names in a set is

=n*(n-1)*(n-2) where n is the number of names. If you have 5 names =5*4*3 =60 Four names: =4*3*2 =24

Are you really sure that you want to do this?

[XOR LX]

Actually I think it's slightly less, since the OP wants every return to contain the same name.

I think it will be:

=3*PERMUT(A1-1,2)

where A1=n.

Regards

[newdoverman]

The OP shows repetition (first two rows of example) which for this example would yield, I believe 18 sets of 3 names. We don't know how many names there are "I have a set of n number of names".

A better definition of the problem I think is in order.
This is how I see the results for the names given with Alex being in each set.

	A	B	C
1	Alex	Bruce	Rob
2	Alex	Bruce	Steve
3	Alex	Rob	Bruce
4	Alex	Rob	Steve
5	Alex	Steve	Bruce
6	Alex	Steve	Rob
7	Bruce	Alex	Rob
8	Bruce	Alex	Steve
9	Rob	Alex	Bruce
10	Rob	Alex	Steve
11	Steve	Alex	Bruce
12	Steve	Alex	Rob
13	Rob	Bruce	Alex
14	Steve	Bruce	Alex
15	Bruce	Rob	Alex
16	Steve	Rob	Alex
17	Bruce	Steve	Alex
18	Rob	Steve	Alex

In any event, I think that I will pass on this.