Search Results for ""

The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

A definite integral is an integral int_a^bf(x)dx (1) with upper and lower limits. If x is restricted to lie on the real line, the definite integral is known as a Riemann ...

An affine variety V is an algebraic variety contained in affine space. For example, {(x,y,z):x^2+y^2-z^2=0} (1) is the cone, and {(x,y,z):x^2+y^2-z^2=0,ax+by+cz=0} (2) is a ...

Given two intersecting lines or line segments, the amount of rotation about the point of intersection (the vertex) required to bring one into correspondence with the other is ...

The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...

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 ...

The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation involving a ...

A circumconic is a conic section that passes through the vertices of a triangle (Kimberling 1998, p. 235). Every circumconic has a trilinear equation of the form ...

A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...