Search Results for ""

An algorithm for finding closed form hypergeometric identities. The algorithm treats sums whose successive terms have ratios which are rational functions. Not only does it ...

The number of poles of an automorphic function in the closure of its fundamental region.

The identity function id(x) is the function id(x)=x which assigns every real number x to the same real number x. It is identical to the identity map. The identity function is ...

j_n(z)=(z^n)/(2^(n+1)n!)int_0^picos(zcostheta)sin^(2n+1)thetadtheta, where j_n(z) is a spherical Bessel function of the first kind.

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

A function which satisfies f(tx,ty)=t^nf(x,y) for a fixed n. Means, the Weierstrass elliptic function, and triangle center functions are homogeneous functions. A ...

The formulas j_n(z) = z^n(-1/zd/(dz))^n(sinz)/z (1) y_n(z) = -z^n(-1/zd/(dz))^n(cosz)/z (2) for n=0, 1, 2, ..., where j_n(z) is a spherical Bessel function of the first kind ...

A univariate function f(x) is said to be odd provided that f(-x)=-f(x). Geometrically, such functions are symmetric about the origin. Examples of odd functions include x, ...

The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in ...

A special function which is given by the logarithmic derivative of the gamma function (or, depending on the definition, the logarithmic derivative of the factorial). Because ...