TOPICS
Search

Search Results for ""


891 - 900 of 2910 for Integer complexitySearch Results
There are several related series that are known as the binomial series. The most general is (x+a)^nu=sum_(k=0)^infty(nu; k)x^ka^(nu-k), (1) where (nu; k) is a binomial ...
A C-matrix is a symmetric (C^(T)=C) or antisymmetric (C^(T)=-C) C_n (-1,0,1)-matrix with diagonal elements 0 and others +/-1 that satisfies CC^(T)=(n-1)I, (1) where I is the ...
The Connell sequence is the sequence obtained by starting with the first positive odd number (1), taking the next two even numbers (2, 4), the next three odd numbers (5, 7, ...
Deck transformations, also called covering transformations, are defined for any cover p:A->X. They act on A by homeomorphisms which preserve the projection p. Deck ...
The exponent is the component of a finite floating-point representation that signifies the integer power to which the radix is raised in determining the value of that ...
A polygonal number and 6-polygonal number of the form n(2n-1). The first few are 1, 6, 15, 28, 45, ... (OEIS A000384). The generating function for the hexagonal numbers is ...
The Kronecker-Weber theorem, sometimes known as the Kronecker-Weber-Hilbert theorem, is one of the earliest known results in class field theory. In layman's terms, the ...
Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...
A modified spherical Bessel function of the first kind (Abramowitz and Stegun 1972), also called a "spherical modified Bessel function of the first kind" (Arfken 1985), is ...
A modified spherical Bessel function of the second kind, also called a "spherical modified Bessel function of the first kind" (Arfken 1985) or (regrettably) a "modified ...
1 ... 87|88|89|90|91|92|93 ... 291 Previous Next

...