Welcome to our community

Be a part of something great, join today!

Algorithm to arrange N people into groups of K


Well-known member
Mar 30, 2016
Hi all!

I've been trying to find a reasonable way to solve following problem:

N people meet each others in groups of K people such that no one meets more than once.

If I'm not mistaken, this requires two things:
  • N must be divisible by K
  • N - 1 must be divisible by K - 1.
Let's assume these conditions hold. How to proceed...? (Wondering) For a more concrete example one can use for example N = 15 and K = 3.