Search Results for ""
8951 - 8960 of 13134 for index theoremSearch Results

The term "left factorial" is sometimes used to refer to the subfactorial !n, the first few values for n=1, 2, ... are 1, 3, 9, 33, 153, 873, 5913, ... (OEIS A007489). ...
Let A be an involutive algebra over the field C of complex numbers with involution xi|->xi^♯. Then A is a left Hilbert algebra if A has an inner product <·,·> satisfying: 1. ...
Given a map f:S->T between sets S and T, the map g:T->S is called a left inverse to f provided that g degreesf=id_S, that is, composing f with g from the left gives the ...
The (associated) Legendre function of the first kind P_n^m(z) is the solution to the Legendre differential equation which is regular at the origin. For m,n integers and z ...
Let E(k) and K(k) be complete elliptic integrals of the first and second kinds, with E^'(k) and K^'(k) the complementary integrals. Then ...
The Legendre transform of a sequence {c_k} is the sequence {a_k} with terms given by a_n = sum_(k=0)^(n)(n; k)(n+k; k)c_k (1) = sum_(k=0)^(n)(2k; k)(n+k; n-k)c_k, (2) where ...
The function defined by chi_nu(z)=sum_(k=0)^infty(z^(2k+1))/((2k+1)^nu). (1) It is related to the polylogarithm by chi_nu(z) = 1/2[Li_nu(z)-Li_nu(-z)] (2) = ...
Legendre's formula counts the number of positive integers less than or equal to a number x which are not divisible by any of the first a primes, (1) where |_x_| is the floor ...
Legion's number of the first kind is defined as L_1 = 666^(666) (1) = 27154..._()_(1871 digits)98016, (2) where 666 is the beast number. It has 1881 decimal digits. Legion's ...
A Lehmer number is a number generated by a generalization of a Lucas sequence. Let alpha and beta be complex numbers with alpha+beta = sqrt(R) (1) alphabeta = Q, (2) where Q ...

...