Search Results for ""

For a logarithmic spiral given parametrically as x = ae^(bt)cost (1) y = ae^(bt)sint, (2) evolute is given by x_e = -abe^(bt)sint (3) y_e = abe^(bt)cost. (4) As first shown ...

A finite sequence of real numbers {a_k}_(k=1)^n is said to be logarithmically concave (or log-concave) if a_i^2>=a_(i-1)a_(i+1) holds for every a_i with 1<=i<=n-1. A ...

The continuous distribution with parameters m and b>0 having probability and distribution functions P(x) = (e^(-(x-m)/b))/(b[1+e^(-(x-m)/b)]^2) (1) D(x) = 1/(1+e^(-(x-m)/b)) ...

The function z=f(x)=ln(x/(1-x)). (1) This function has an inflection point at x=1/2, where f^('')(x)=(2x-1)/(x^2(x-1)^2)=0. (2) Applying the logit transformation to values ...

The Lommel differential equation is a generalization of the Bessel differential equation given by z^2y^('')+zy^'+(z^2-nu^2)y=kz^(mu+1), (1) or, in the most general form, by ...

The Lommel polynomials R_(m,nu)(z) arise from the equation J_(m+nu)(z)=J_nu(z)R_(m,nu)(z)-J_(nu-1)(z)R_(m-1,nu+1)(z), (1) where J_nu(z) is a Bessel function of the first kind ...

Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...

The longest increasing scattered subsequence is the longest subsequence of increasing terms, where intervening nonincreasing terms may be dropped. Finding the largest ...

The longest increasing (contiguous) subsequence of a given sequence is the subsequence of increasing terms containing the largest number of elements. For example, the longest ...

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...