<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" version="2.0">
  <channel>
    <title>MaplePrimes - answers and comments on Question, How to get maple to output combinations (not the total)</title>
    <link>http://www.mapleprimes.com/questions/140452-How-To-Get-Maple-To-Output-Combinations-not-The-Total</link>
    <language>en-us</language>
    <copyright>2026 Maplesoft, A Division of Waterloo Maple Inc.</copyright>
    <generator>Maplesoft Document System</generator>
    <lastBuildDate>Wed, 10 Jun 2026 23:53:53 GMT</lastBuildDate>
    <pubDate>Wed, 10 Jun 2026 23:53:53 GMT</pubDate>
    <itunes:subtitle />
    <itunes:summary />
    <description>The latest answers and comments added to the Question, How to get maple to output combinations (not the total)</description>
    <image>
      <url>http://www.mapleprimes.com/images/mapleprimeswhite.jpg</url>
      <title>MaplePrimes - answers and comments on Question, How to get maple to output combinations (not the total)</title>
      <link>http://www.mapleprimes.com/questions/140452-How-To-Get-Maple-To-Output-Combinations-not-The-Total</link>
    </image>
    <item>
      <title>all done</title>
      <link>http://www.mapleprimes.com/questions/140452-How-To-Get-Maple-To-Output-Combinations-not-The-Total?ref=Feed:MaplePrimes:How to get maple to output combinations (not the total):Comments#answer140454</link>
      <itunes:summary>&lt;p&gt;never mind i've just done it... was a lot easier than I thought&amp;nbsp;&lt;br&gt;its no where near polished but heres like the basic idea of it&amp;nbsp;&lt;/p&gt;
&lt;pre&gt;MultiSetR:=[{2, 8}, {2, 4, 6, 7, 8}, {4, 6, 8}, {1, 4, 8}, {1, 4, 8, 9}];
for i from 1 to numelems(MultiSetR) do 
  for j from i+1 to numelems(MultiSetR) do 
    for k from j+1 to numelems(MultiSetR) do
       MultiSetR[i]:
       MultiSetR[j]:
       MultiSetR[k]:
       printf(" %a ,%a, %a \n", MultiSetR[i], MultiSetR[j], MultiSetR[k]):
    od:
  od:
od:&lt;/pre&gt;
&lt;p&gt;&amp;nbsp;&lt;/p&gt;
&lt;pre&gt; {2, 8} ,{2, 4, 6, 7, 8}, {4, 6, 8} &lt;br&gt; {2, 8} ,{2, 4, 6, 7, 8}, {1, 4, 8} &lt;br&gt; {2, 8} ,{2, 4, 6, 7, 8}, {1, 4, 8, 9} &lt;br&gt; {2, 8} ,{4, 6, 8}, {1, 4, 8} &lt;br&gt; {2, 8} ,{4, 6, 8}, {1, 4, 8, 9} &lt;br&gt; {2, 8} ,{1, 4, 8}, {1, 4, 8, 9} &lt;br&gt; {2, 4, 6, 7, 8} ,{4, 6, 8}, {1, 4, 8} &lt;br&gt; {2, 4, 6, 7, 8} ,{4, 6, 8}, {1, 4, 8, 9} &lt;br&gt; {2, 4, 6, 7, 8} ,{1, 4, 8}, {1, 4, 8, 9} &lt;br&gt; {4, 6, 8} ,{1, 4, 8}, {1, 4, 8, 9} &lt;br&gt;&lt;br&gt;&lt;/pre&gt;</itunes:summary>
      <description>&lt;p&gt;never mind i've just done it... was a lot easier than I thought&amp;nbsp;&lt;br&gt;its no where near polished but heres like the basic idea of it&amp;nbsp;&lt;/p&gt;
&lt;pre&gt;MultiSetR:=[{2, 8}, {2, 4, 6, 7, 8}, {4, 6, 8}, {1, 4, 8}, {1, 4, 8, 9}];
for i from 1 to numelems(MultiSetR) do 
  for j from i+1 to numelems(MultiSetR) do 
    for k from j+1 to numelems(MultiSetR) do
       MultiSetR[i]:
       MultiSetR[j]:
       MultiSetR[k]:
       printf(" %a ,%a, %a \n", MultiSetR[i], MultiSetR[j], MultiSetR[k]):
    od:
  od:
od:&lt;/pre&gt;
&lt;p&gt;&amp;nbsp;&lt;/p&gt;
&lt;pre&gt; {2, 8} ,{2, 4, 6, 7, 8}, {4, 6, 8} &lt;br&gt; {2, 8} ,{2, 4, 6, 7, 8}, {1, 4, 8} &lt;br&gt; {2, 8} ,{2, 4, 6, 7, 8}, {1, 4, 8, 9} &lt;br&gt; {2, 8} ,{4, 6, 8}, {1, 4, 8} &lt;br&gt; {2, 8} ,{4, 6, 8}, {1, 4, 8, 9} &lt;br&gt; {2, 8} ,{1, 4, 8}, {1, 4, 8, 9} &lt;br&gt; {2, 4, 6, 7, 8} ,{4, 6, 8}, {1, 4, 8} &lt;br&gt; {2, 4, 6, 7, 8} ,{4, 6, 8}, {1, 4, 8, 9} &lt;br&gt; {2, 4, 6, 7, 8} ,{1, 4, 8}, {1, 4, 8, 9} &lt;br&gt; {4, 6, 8} ,{1, 4, 8}, {1, 4, 8, 9} &lt;br&gt;&lt;br&gt;&lt;/pre&gt;</description>
      <guid>140454</guid>
      <pubDate>Fri, 16 Nov 2012 23:28:31 Z</pubDate>
      <itunes:author>LouWatts</itunes:author>
      <author>LouWatts</author>
    </item>
    <item>
      <title>combinat:-choose</title>
      <link>http://www.mapleprimes.com/questions/140452-How-To-Get-Maple-To-Output-Combinations-not-The-Total?ref=Feed:MaplePrimes:How to get maple to output combinations (not the total):Comments#answer140516</link>
      <itunes:summary>&lt;p&gt;The choose command in the combinat package will help you with this:&lt;/p&gt;
&lt;pre&gt;restart;&lt;br&gt;with(combinat):&lt;br&gt;&lt;br&gt;S := [{2, 8}, {2, 4, 6, 7, 8}, {4, 6, 8}, {1, 4, 8}, {1, 4, 8, 9}];&lt;br&gt; [{2, 8}, {2, 4, 6, 7, 8}, {4, 6, 8}, {1, 4, 8}, {1, 4, 8, 9}]&lt;br&gt;&lt;br&gt;&lt;/pre&gt;
&lt;pre&gt;choose( S, 3 );&lt;br&gt;         [[{2, 8}, {1, 4, 8}, {4, 6, 8}], &lt;br&gt;&lt;br&gt;           [{2, 8}, {1, 4, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;           [{2, 8}, {1, 4, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;           [{2, 8}, {4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;           [{2, 8}, {4, 6, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;           [{2, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;           [{1, 4, 8}, {4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;           [{1, 4, 8}, {4, 6, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;           [{1, 4, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;           [{4, 6, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}]]&lt;br&gt;nops( % );&lt;br&gt;                               10&lt;br&gt;&lt;br&gt;choose( S );&lt;br&gt;[[], [{2, 8}], [{1, 4, 8}], [{4, 6, 8}], [{1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{2, 4, 6, 7, 8}], [{2, 8}, {1, 4, 8}], [{2, 8}, {4, 6, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8, 9}], [{2, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {4, 6, 8}], [{1, 4, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {2, 4, 6, 7, 8}], [{4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{4, 6, 8}, {2, 4, 6, 7, 8}], [{1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {4, 6, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {4, 6, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {4, 6, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{4, 6, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {4, 6, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {4, 6, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {4, 6, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {4, 6, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}]]&lt;br&gt;nops(%);&lt;br&gt;                               32&lt;/pre&gt;
&lt;!--break--&gt;
&lt;p&gt;&amp;nbsp;&lt;/p&gt;
&lt;p&gt;This finds the 10 three element subsets of this set of 5 sets. It also shows that there are a total of 32 different subsets with between 0 and 5 elements.&lt;/p&gt;
&lt;p&gt;I hope this is still of some use to you.&lt;/p&gt;
&lt;p&gt;Doug&lt;/p&gt;
&lt;pre&gt;---------------------------------------------------------------------
Douglas B. Meade  &amp;lt;&amp;gt;&amp;lt;
Math, USC, Columbia, SC 29208  E-mail: mailto:meade@math.sc.edu
Phone:  (803) 777-6183         URL:    http://www.math.sc.edu&lt;/pre&gt;</itunes:summary>
      <description>&lt;p&gt;The choose command in the combinat package will help you with this:&lt;/p&gt;
&lt;pre&gt;restart;&lt;br&gt;with(combinat):&lt;br&gt;&lt;br&gt;S := [{2, 8}, {2, 4, 6, 7, 8}, {4, 6, 8}, {1, 4, 8}, {1, 4, 8, 9}];&lt;br&gt; [{2, 8}, {2, 4, 6, 7, 8}, {4, 6, 8}, {1, 4, 8}, {1, 4, 8, 9}]&lt;br&gt;&lt;br&gt;&lt;/pre&gt;
&lt;pre&gt;choose( S, 3 );&lt;br&gt;         [[{2, 8}, {1, 4, 8}, {4, 6, 8}], &lt;br&gt;&lt;br&gt;           [{2, 8}, {1, 4, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;           [{2, 8}, {1, 4, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;           [{2, 8}, {4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;           [{2, 8}, {4, 6, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;           [{2, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;           [{1, 4, 8}, {4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;           [{1, 4, 8}, {4, 6, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;           [{1, 4, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;           [{4, 6, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}]]&lt;br&gt;nops( % );&lt;br&gt;                               10&lt;br&gt;&lt;br&gt;choose( S );&lt;br&gt;[[], [{2, 8}], [{1, 4, 8}], [{4, 6, 8}], [{1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{2, 4, 6, 7, 8}], [{2, 8}, {1, 4, 8}], [{2, 8}, {4, 6, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8, 9}], [{2, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {4, 6, 8}], [{1, 4, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {2, 4, 6, 7, 8}], [{4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{4, 6, 8}, {2, 4, 6, 7, 8}], [{1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {4, 6, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {4, 6, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {4, 6, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{4, 6, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {4, 6, 8}, {1, 4, 8, 9}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {4, 6, 8}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {4, 6, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{1, 4, 8}, {4, 6, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}], &lt;br&gt;&lt;br&gt;  [{2, 8}, {1, 4, 8}, {4, 6, 8}, {1, 4, 8, 9}, {2, 4, 6, 7, 8}]]&lt;br&gt;nops(%);&lt;br&gt;                               32&lt;/pre&gt;
&lt;!--break--&gt;
&lt;p&gt;&amp;nbsp;&lt;/p&gt;
&lt;p&gt;This finds the 10 three element subsets of this set of 5 sets. It also shows that there are a total of 32 different subsets with between 0 and 5 elements.&lt;/p&gt;
&lt;p&gt;I hope this is still of some use to you.&lt;/p&gt;
&lt;p&gt;Doug&lt;/p&gt;
&lt;pre&gt;---------------------------------------------------------------------
Douglas B. Meade  &amp;lt;&amp;gt;&amp;lt;
Math, USC, Columbia, SC 29208  E-mail: mailto:meade@math.sc.edu
Phone:  (803) 777-6183         URL:    http://www.math.sc.edu&lt;/pre&gt;</description>
      <guid>140516</guid>
      <pubDate>Mon, 19 Nov 2012 13:11:18 Z</pubDate>
      <itunes:author>Doug Meade</itunes:author>
      <author>Doug Meade</author>
    </item>
  </channel>
</rss>