TOPICS
Search

Search Results for ""


1291 - 1300 of 5881 for math 0Search Results
If Y_i have normal independent distributions with mean 0 and variance 1, then chi^2=sum_(i=1)^rY_i^2 (1) is distributed as chi^2 with r degrees of freedom. This makes a chi^2 ...
Erfc is the complementary error function, commonly denoted erfc(z), is an entire function defined by erfc(z) = 1-erf(z) (1) = 2/(sqrt(pi))int_z^inftye^(-t^2)dt. (2) It is ...
The Euler-Lagrange differential equation is the fundamental equation of calculus of variations. It states that if J is defined by an integral of the form J=intf(t,y,y^.)dt, ...
A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...
The m×n king graph is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a king. The number ...
The Laplacian for a scalar function phi is a scalar differential operator defined by (1) where the h_i are the scale factors of the coordinate system (Weinberg 1972, p. 109; ...
A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...
A primitive polynomial is a polynomial that generates all elements of an extension field from a base field. Primitive polynomials are also irreducible polynomials. For any ...
The number of cells in a generalized Chinese checkers board (or "centered" hexagram). Unlike the polygonal numbers, there is ambiguity in the case of the star numbers as to ...
The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...
1 ... 127|128|129|130|131|132|133 ... 589 Previous Next

...