Search Results for ""

The exponential sum function e_n(x), sometimes also denoted exp_n(x), is defined by e_n(x) = sum_(k=0)^(n)(x^k)/(k!) (1) = (e^xGamma(n+1,x))/(Gamma(n+1)), (2) where ...

A function I_n(x) which is one of the solutions to the modified Bessel differential equation and is closely related to the Bessel function of the first kind J_n(x). The above ...

The function f(x,y)=(1-x)^2+100(y-x^2)^2 that is often used as a test problem for optimization algorithms (where a variation with 100 replaced by 105 is sometimes used; ...

The Mertens function is the summary function M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function (Mertens 1897; Havil 2003, p. 208). The first few values are 1, 0, ...

A cadlag function is a function, defined on R or a subset of R, that is right continuous and has a left limit. The acronym cadlag comes from the French "continue à droite, ...

f(I) is the collection of all real-valued continuous functions defined on some interval I. f^((n))(I) is the collection of all functions in f(I) with continuous nth ...

The function giving the volume of the spherical quadrectangular tetrahedron: V=(pi^2)/8f(pi/p,pi/q,pi/r), (1) where (2) and D=sqrt(cos^2xcos^2z-cos^2y). (3)

A function H that maps an arbitrary length message M to a fixed length message digest MD is a collision-free hash function if 1. It is a one-way hash function. 2. It is hard ...

There are two camps of thought on the meaning of general recursive function. One camp considers general recursive functions to be equivalent to the usual recursive functions. ...

For any alpha in A (where A denotes the set of algebraic numbers), let |alpha|^_ denote the maximum of moduli of all conjugates of alpha. Then a function ...