Search Results for ""

A lozenge (or rhombus) algorithm is a class of transformation that can be used to attempt to produce series convergence improvement (Hamming 1986, p. 207). The best-known ...

The set of L^p-functions (where p>=1) generalizes L2-space. Instead of square integrable, the measurable function f must be p-integrable for f to be in L^p. On a measure ...

A Lucas chain for an integer n>=1 is an increasing sequence 1=a_0<a_1<a_2<...<a_r=n of integers such that every a_k, k>=1, can be written as a sum a_k=a_i+a_j of smaller ...

The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...

A Lucas polynomial sequence is a pair of generalized polynomials which generalize the Lucas sequence to polynomials is given by W_n^k(x) = ...

When P and Q are integers such that D=P^2-4Q!=0, define the Lucas sequence {U_k} by U_k=(a^k-b^k)/(a-b) for k>=0, with a and b the two roots of x^2-Px+Q=0. Then define a ...

An n-step Lucas sequence {L_k^((n))}_(k=1)^infty is defined by letting L_k^((n))=-1 for k<0, L_0^((n))=n, and other terms according to the linear recurrence equation ...

Lucas's theorem states that if n>=3 be a squarefree integer and Phi_n(z) a cyclotomic polynomial, then Phi_n(z)=U_n^2(z)-(-1)^((n-1)/2)nzV_n^2(z), (1) where U_n(z) and V_n(z) ...

The Lyapunov condition, sometimes known as Lyapunov's central limit theorem, states that if the (2+epsilon)th moment (with epsilon>0) exists for a statistical distribution of ...

The first few numbers not known to produce palindromes when applying the 196-algorithm (i.e., a reverse-then-add sequence) are sometimes known as Lychrel numbers. This term ...