TOPICS
Search

Search Results for ""


1381 - 1390 of 3040 for Special Unitary MatrixSearch Results
The Gelfond-Schneider constant is sometimes known as the Hilbert number. Flannery and Flannery (2000, p. 35) define a Hilbert number as a positive integer of the form n=4k+1 ...
A composite number defined analogously to a Smith number except that the sum of the number's digits equals the sum of the digits of its distinct prime factors (excluding 1). ...
The idempotent numbers are given by B_(n,k)(1,2,3,...)=(n; k)k^(n-k), where B_(n,k) is a Bell polynomial and (n; k) is a binomial coefficient. A table of the first few is ...
The identity function id(x) is the function id(x)=x which assigns every real number x to the same real number x. It is identical to the identity map. The identity function is ...
The Jacobsthal polynomials are the W-polynomial obtained by setting p(x)=1 and q(x)=2x in the Lucas polynomial sequence. The first few Jacobsthal polynomials are J_1(x) = 1 ...
Kelvin defined the Kelvin functions bei and ber according to ber_nu(x)+ibei_nu(x) = J_nu(xe^(3pii/4)) (1) = e^(nupii)J_nu(xe^(-pii/4)), (2) = e^(nupii/2)I_nu(xe^(pii/4)) (3) ...
The numbers defined by the recurrence relation K_(n+1)=1+min(2K_(|_n/2_|),3K_(|_n/3_|)), with K_0=1. The first few values for n=0, 1, 2, ... are 1, 3, 3, 4, 7, 7, 7, 9, 9, ...
Let alpha(x) be a step function with the jump j(x)=(N; x)p^xq^(N-x) (1) at x=0, 1, ..., N, where p>0,q>0, and p+q=1. Then the Krawtchouk polynomial is defined by ...
By analogy with the log sine function, define the log cosine function by C_n=int_0^(pi/2)[ln(cosx)]^ndx. (1) The first few cases are given by C_1 = -1/2piln2 (2) C_2 = ...
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 = ...
1 ... 136|137|138|139|140|141|142 ... 304 Previous Next

...