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 radical circle of the Lucas circles is the circumcircle of the Lucas tangents triangle. Its center has trilinear center function alpha_(1151)=2cosA+sinA (1) corresponding ...

The Lucas cubic is a pivotal isotomic cubic having pivot point at Kimberling center X_(69), the isogonal conjugate of the orthocenter, i.e., the locus of points P such that ...

There are two nonintersecting circles that are tangent to all three Lucas circles. (These are therefore the Soddy circles of the Lucas central triangle.) The inner one, ...

The points of tangency of the Lucas inner circle with the Lucas circles are the inverses of the vertices A, B, and C in the Lucas circles radical circle. These form the Lucas ...

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