MathGroup Archive 1997

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

Search the Archive

Re: REQ:Algorythm for combinations

  • To: mathgroup at
  • Subject: [mg8550] Re: REQ:Algorythm for combinations
  • From: murray at (Murray Eisenberg)
  • Date: Sat, 6 Sep 1997 23:16:16 -0400
  • Organization: University of Massachusetts, Amherst
  • Sender: owner-wri-mathgroup at

marc borms (marc at wrote:
: who knows the algorythm or a program to print out 
: all possible combinations of x elements ?

If you mean "permuations" rather than "combinations", then this is a
built-in function (at least in Mathematica 3.0).

If you do indeed mean "combinations", then see the function KSubsets
in standard addon package DiscreteMath`Combinatorica`.

  Murray Eisenberg                       Internet:  murray at
  Mathematics & Statistics Dept.            Voice:  413-545-2859 (W)
  University of Massachusetts                       413-549-1020 (H)
  Amherst, MA 01003                           Fax:  413-545-1801

  • Prev by Date: Re: Q??: Solve::"eqf": "False is not a well-formed equation
  • Next by Date: Re: Mathematica's FactorialSimplify command
  • Previous by thread: Re: REQ:Algorythm for combinations
  • Next by thread: REQ:Algorythm for combinations