Search Results for ""
1171 - 1180 of 2820 for Vertex FormSearch Results
The theta series of a lattice is the generating function for the number of vectors with norm n in the lattice. Theta series for a number of lattices are implemented in the ...
Given a sequence S_i as input to stage i, form sequence S_(i+1) as follows: 1. For k in [1,...,i], write term i+k and then term i-k. 2. Discard the ith term. 3. Write the ...
The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...
A binomial number is a number of the form a^n+/-b^n, where a,b, and n are integers. Binomial numbers can be factored algebraically as ...
The most common form of cosine integral is Ci(x) = -int_x^infty(costdt)/t (1) = gamma+lnx+int_0^x(cost-1)/tdt (2) = 1/2[Ei(ix)+Ei(-ix)] (3) = -1/2[E_1(ix)+E_1(-ix)], (4) ...
The Darboux integral, also called a Darboux-Stieltjes integral, is a variant of the Stieltjes integral that is defined as a common value for the lower and upper Darboux ...
Green's theorem is a vector identity which is equivalent to the curl theorem in the plane. Over a region D in the plane with boundary partialD, Green's theorem states ...
Matrix diagonalization is the process of taking a square matrix and converting it into a special type of matrix--a so-called diagonal matrix--that shares the same fundamental ...
Newton's forward difference formula is a finite difference identity giving an interpolated value between tabulated points {f_p} in terms of the first value f_0 and the powers ...
Hadamard matrices H_n can be constructed using finite field GF(p^m) when p=4l-1 and m is odd. Pick a representation r relatively prime to p. Then by coloring white ...
...
View search results from all Wolfram sites (338825 matches)

