Search Results for ""

The log sine function, also called the logsine function, is defined by S_n=int_0^pi[ln(sinx)]^ndx. (1) The first few cases are given by S_1 = -piln2 (2) S_2 = ...

Infinite series of various simple functions of the logarithm include sum_(k=1)^^^inftylnk = 1/2ln(2pi) (1) sum_(k=1)^^^infty(-1)^klnk = 1/2ln(1/2pi) (2) ...

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 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 ...

An infinite sequence of homomorphisms of modules or additive Abelian groups ...->C_(i+1)->^(d_(i+1))C_i->^(d_i)C_(i-1)->... (1) such that, for all indices i in Z, ...

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 ...