Search Results for ""

Any computable function can be incorporated into a program using while-loops (i.e., "while something is true, do something else"). For-loops (which have a fixed iteration ...

A generalized hypergeometric function _pF_q(a_1,...,a_p;b_1,...,b_q;x) is a function which can be defined in the form of a hypergeometric series, i.e., a series for which the ...

A function f(x) is said to be antiperiodic with antiperiod p if -f(x)=f(x+np) for n=1, 3, .... For example, the sine function sinx is antiperiodic with period pi (as well as ...

The interesting function defined by the definite integral G(x)=int_0^xsin(tsint)dt, illustrated above (Glasser 1990). The integral cannot be done in closed form, but has a ...

A function is said to be modular (or "elliptic modular") if it satisfies: 1. f is meromorphic in the upper half-plane H, 2. f(Atau)=f(tau) for every matrix A in the modular ...

A completely multiplicative function, sometimes known as linear or totally multiplicative function, is an arithmetic function f(n) such that f(mn)=f(m)f(n) holds for each ...

The Cunningham function, sometimes also called the Pearson-Cunningham function, can be expressed using Whittaker functions (Whittaker and Watson 1990, p. 353). ...

A symmetric function on n variables x_1, ..., x_n is a function that is unchanged by any permutation of its variables. In most contexts, the term "symmetric function" refers ...

A function which arises in the fractional integral of e^(at), given by E_t(nu,a) = (e^(at))/(Gamma(nu))int_0^tx^(nu-1)e^(-ax)dx (1) = (a^(-nu)e^(at)gamma(nu,at))/(Gamma(nu)), ...

A folding function is a function that maps the integers Z={...,-3,-2,-1,0,1,2,3,...} onto the nonnegative integers Z^*={0,1,2,3,...}. This type of function arises naturally ...