Ok should be pretty easy but bain not working this morning.....

I have twelve numbers, 1-12 I need to do some playing weith them.....


I need each number to appear in a group 6 times and try not to have it with the same numbers that it was before as far as possible.....


Anyone good with numbers could help out ?????

All will become apparent when I get the numbers back, there is a very good reason for this....

I should have said I need the number to appear in batches of 3 trying as much as possible to not appear with the same numbers in more than one group !!!

[quote name='rhaines' date='Jun 30 2003, 12:01 PM']Anyone good with numbers could help out ?????

All will become apparent when I get the numbers back, there is a very good reason for this....


[/quote]
is this a plot for the TOC ?
now the LOC have enough drivers for the go-karting

Dude,

1.2.3
4.5.6
7.8.9
10.11.12

once you get to that level you will have to start to repeat the numbers.

then to make sure you dont get too much replication take numbers from each batch:
1.4.7
2.5.8
3.6.9

(something like that)

does that make any sence?

If you want email me the full details and perhaps I can offer a hand? (math degree, specialist in group theory) :-)

Lee

nope I was simplifying the problem, I am trying to get a list of drivers for each heat where everybody races someone different in each heat, if I can get the grouped numbers sorted for 1-12 I can then copy the formula for 21-22 and do the same for toc as we have a full complement.

It's just a PITA to try and arrange 12 people into teams of three where each person races 6 times without racing with the same people from their team

mi m8,

if u want every "racer" to drive against every other racer in the least number of "runs" then it would be easy to do a 12 run:

basics...

number of cars/ppl x number of runs

12 x 1
6 x 2
4 x 3
3 x 4
2 x 6
1 x 12

are you constraint by number of runs?

if not you may have uneven number of ppl in each run, to make sure everyone "goes" against everyone

Lee