Artifact 16559cbc7b205d6505304fd56d812601a7118ab82b9f46f6ee8485f05e1f6d6a:

• Executable file r37/lisp/csl/html/r37_0074.html — part of check-in [f2fda60abd] at 2011-09-02 18:13:33 on branch master — Some historical releases purely for archival purposes

  git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 651) [annotate] [blame] [check-ins using] [more...]

<A NAME=CHOOSE>

<TITLE>CHOOSE</TITLE></A>
<b><a href=r37_idx.html>INDEX</a></b><p><p>



<B>CHOOSE</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
<em>choose</em>(&lt;m&gt;,&lt;m&gt;) returns the number of ways of choosing 
&lt;m&gt; objects from a collection of &lt;n&gt; distinct objects --- in other 
words the binomial coefficient. If &lt;m&gt; and &lt;n&gt; are not positive 
integers, or m &gt;n, the expression is returned unchanged. 
than or equal to 
 <P> <H3> 
examples: </H3>
<P><PRE><TT>
choose(2,3); 

  3 


choose(3,2); 

  CHOOSE(3,2) 


choose(a,b); 

  CHOOSE(A,B)

</TT></PRE><P><P>
<P>