friend numeric asinh(numeric const & x);
friend numeric acosh(numeric const & x);
friend numeric atanh(numeric const & x);
+ friend numeric bernoulli(numeric const & n);
friend numeric abs(numeric const & x);
friend numeric mod(numeric const & a, numeric const & b);
friend numeric smod(numeric const & a, numeric const & b);
numeric factorial(numeric const & n);
numeric doublefactorial(numeric const & n);
numeric binomial(numeric const & n, numeric const & k);
+numeric bernoulli(numeric const & n);
numeric abs(numeric const & x);
numeric mod(numeric const & a, numeric const & b);
inline numeric denom(numeric const & x)
{ return x.denom(); }
-/* do we need this any more? */
-//inline numeric factorial(int n)
-//{ return factorial(numeric(n)); }
-
-/* do we need this any more? */
-//inline numeric binomial(int n, int k)
-//{ return binomial(numeric(n), numeric(k)); }
-
ex IEvalf(void);
ex PiEvalf(void);
ex EulerGammaEvalf(void);