# Re: Can anybody help me to find a potential application for this mathematical problem

From: -CELKO- <jcelko212_at_earthlink.net>

Date: Mon, 16 Jun 2008 09:42:46 -0700 (PDT)

Message-ID: <084fdda9-c1a8-4a36-b3e7-9e999a4efae4_at_y38g2000hsy.googlegroups.com>

Date: Mon, 16 Jun 2008 09:42:46 -0700 (PDT)

Message-ID: <084fdda9-c1a8-4a36-b3e7-9e999a4efae4_at_y38g2000hsy.googlegroups.com>

>> Is there any application for this problem? <<

This sounds like a version of the "golfer problem" -- given a bunch of people, break them into groups of (n) such that no two people are in a grouping more than (k) times. The idea is to keep you playing with some new blood each round. Look at the recreational math newsgroup; there ought to be something there. Received on Mon Jun 16 2008 - 18:42:46 CEST