Search Results for ""

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

Let P(1/x) be a linear functional acting according to the formula <P(1/x),phi> = Pint(phi(x))/xdx (1) = ...

A surface given by the parametric equations x(u,v) = u (1) y(u,v) = v (2) z(u,v) = 1/3u^3+uv^2+2(u^2-v^2). (3) The handkerchief surface has stationary points summarized in ...

A surface which a monkey can straddle with both legs and his tail. A simple Cartesian equation for such a surface is z=x(x^2-3y^2), (1) which can also be given by the ...

A prime power is a prime or integer power of a prime. A test for a number n being a prime is implemented in the Wolfram Language as PrimePowerQ[n]. The first few prime powers ...

Given the Lucas sequence U_n(b,-1) and V_n(b,-1), define Delta=b^2+4. Then an extra strong Lucas pseudoprime to the base b is a composite number n=2^rs+(Delta/n), where s is ...

The Mittag-Leffler function (Mittag-Leffler 1903, 1905) is an entire function defined by the series E_alpha(z)=sum_(k=0)^infty(z^k)/(Gamma(alphak+1)) (1) for alpha>0. It is ...

The delta function is a generalized function that can be defined as the limit of a class of delta sequences. The delta function is sometimes called "Dirac's delta function" ...

The series sum_(k=1)^infty1/k (1) is called the harmonic series. It can be shown to diverge using the integral test by comparison with the function 1/x. The divergence, ...

A strong pseudoprime to a base a is an odd composite number n with n-1=d·2^s (for d odd) for which either a^d=1 (mod n) (1) or a^(d·2^r)=-1 (mod n) (2) for some r=0, 1, ..., ...