Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
1996
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1996

[Date Index] [Thread Index] [Author Index]

Search the Archive

question

  • To: mathgroup at smc.vnet.net
  • Subject: [mg4721] question
  • From: Harry Stein <hstein at asset-intertech.com>
  • Date: Sat, 31 Aug 1996 03:57:39 -0400
  • Organization: ASSET InterTech Inc.
  • Sender: owner-wri-mathgroup at wolfram.com

I need help with the following question, please.

I have P people and C clubs.

There are as many or more people as there are clubs
(P >= C).

Each person belongs to ONE or TWO clubs.

Every club has at least one member (person).

Given these assumptions, how can I generalize the
unique number of combinations for different values
of P, C.

Realistically, my application deals with P in the range
1-128 and C in the range 1-32.  I am trying to determine
if this is an intractable problem for solving with a
computer (I do a few simple calculations for each
each combination) but don't have a feel for the number
of combinations.

If it is tractable, I am also looking for an algorithm
(C, C++, Pascal, Basic, Fortran, etc.) that generates
the combinations in some form of an array for the P
people, showing the one or two clubs they are a member
of for that combination.

As I am not part of this group, please send me replys
privately.


Thanks,

==== [MESSAGE SEPARATOR] ====


  • Prev by Date: Re: Integer Partitioning (correction)
  • Next by Date: Software
  • Previous by thread: Re: Integer Partitioning (correction)
  • Next by thread: Software