Search Results for ""

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

n-minex is defined as 10^(-n).

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

From the point of view of coordinate charts, the notion of tangent space is quite simple. The tangent space consists of all directions, or velocities, a particle can take. In ...

3 is the only integer which is the sum of the preceding positive integers (1+2=3) and the only number which is the sum of the factorials of the preceding positive integers ...

Let K be a field, and A a K-algebra. Elements y_1, ..., y_n are algebraically independent over K if the natural surjection K[Y_1,...,Y_n]->K[y_1,...,y_n] is an isomorphism. ...

If f(x) is piecewise continuous and has a generalized Fourier series sum_(i)a_iphi_i(x) (1) with weighting function w(x), it must be true that ...

A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...

A game in which no draw is possible. Steinhaus (1999, p. 16) stated that all categorical games are unfair, but this is incorrect. For example, the game "Odds or Evens" pits ...

The 60 Pascal lines of a hexagon inscribed in a conic intersect three at a time through 20 Steiner points, and also three at a time in 60 Kirkman points. Each Steiner point ...