Search Results for ""

The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly. When an ant ...

The associated Legendre differential equation is a generalization of the Legendre differential equation given by d/(dx)[(1-x^2)(dy)/(dx)]+[l(l+1)-(m^2)/(1-x^2)]y=0, (1) which ...

The bei_nu(z) function is defined through the equation J_nu(ze^(3pii/4))=ber_nu(z)+ibei_nu(z), (1) where J_nu(z) is a Bessel function of the first kind, so ...

The function ber_nu(z) is defined through the equation J_nu(ze^(3pii/4))=ber_nu(z)+ibei_nu(z), (1) where J_nu(z) is a Bessel function of the first kind, so ...

An interpolation formula, sometimes known as the Newton-Bessel formula, given by (1) for p in [0,1], where delta is the central difference and B_(2n) = 1/2G_(2n) (2) = ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_5=f(x_5). Then Boole's rule approximating the ...

A set of positive integers S is called sum-free if the equation x+y=z has no solutions x, y, z in S. The probability that a random sum-free set S consists entirely of odd ...

The central difference for a function tabulated at equal intervals f_n is defined by delta(f_n)=delta_n=delta_n^1=f_(n+1/2)-f_(n-1/2). (1) First and higher order central ...

Apply Markov's inequality with a=k^2 to obtain P[(x-mu)^2>=k^2]<=(<(x-mu)^2>)/(k^2)=(sigma^2)/(k^2). (1) Therefore, if a random variable x has a finite mean mu and finite ...

The hyperbolic cosine integral, often called the "Chi function" for short, is defined by Chi(z)=gamma+lnz+int_0^z(cosht-1)/tdt, (1) where gamma is the Euler-Mascheroni ...