I'm looking for an algorithm for dividing a set of numbers into groups, and then doing it again in such a way that no numbers are in a group together more than once.(adsbygoogle = window.adsbygoogle || []).push({});

For instance if you have 18 numbers and divide them into groups of three you should be able to do this 8 times without any numbers having to be in the same group more than once. Any idea how I can do this?

This website: http://mathpages.com/home/kmath388.htm

kinda describes what I'm looking for, but I don't quite get the hang of how they do it, when I try to do something similar with other numbers I end up with repeats (I try to replicate the part where they divide 24 people into four-man-groups in seven different ways).

Thanks in advance for any help. :)

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Algorithm for dividing a set of numbers into groups

Loading...

Similar Threads for Algorithm dividing numbers |
---|

I Repeatability of necessity: number restrictions? |

A Pairing algorithm |

I Dividing 4 balls over 4 boxes |

B Bellman's and Bellman-Ford algorithm |

I Dijkstra's algorithm spp |

**Physics Forums | Science Articles, Homework Help, Discussion**