Artifact 9eb3b875be996ad17bf00b02f913e23bfadebab992fb66657ff9889ac45a6e87:

• Executable file r37/lisp/csl/html/r37_0520.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: 885) [annotate] [blame] [check-ins using] [more...]

<A NAME=BINOMIAL>

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



<B>BINOMIAL</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
The <em>Binomial</em> operator returns the Binomial coefficient if both 
parameter are integer and expressions involving the Gamma function otherwise. 
<P>
<P>
 <P> <H3> 
syntax: </H3>
<em>Binomial</em>(&lt;integer&gt;,&lt;integer&gt;) 
<P>
<P>
<P>
<P>
 <P> <H3> 
examples: </H3>
<P><PRE><TT>
Binomial(49,6); 

  13983816 



Binomial(n,3); 

   gamma(n + 1)
  ---------------
  6*gamma(n - 2)

</TT></PRE><P>The operator <em>Binomial</em> evaluates the Binomial coefficients
 from 
the explicit form and therefore it is not the best algorithm if you 
want to compute many binomial coefficients with big indices in which 
case a recursive algorithm is preferable. 
<P>
<P>
<P>