Artifact 4f0a811cc1ee8dd69c832f9797c2d8b8fa1f3ddae24bd95e51b830e34af09a97:

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

<A NAME=EULER>

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



<B>EULER</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
The <em>EULER</em> operator returns the nth Euler number. 
<P>
<P>
 <P> <H3> 
syntax: </H3>
<em>Euler</em>(&lt;integer&gt;) 
<P>
<P>
<P>
 <P> <H3> 
examples: </H3>
<P><PRE><TT>
Euler 20; 

  370371188237525 


Euler 0; 

  1

</TT></PRE><P>The <em>Euler</em> numbers are evaluated by a recursive algorithm 
which 
makes it hard to compute Euler numbers above say 200. 
<P>
<P>
Euler numbers appear in the coefficients of the power series 
representation of 1/cos(z). 
<P>
<P>
<P>