Search Results for ""

A number of four-tetrahedron compounds can be constructed by rotating about the center-centroid lines of each face. Three such compounds are shown above for rotations by ...

The triangular number T_n is a figurate number that can be represented in the form of a triangular grid of points where the first row contains a single element and each ...

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

An unhappy number is a number that is not happy, i.e., a number n such that iterating this sum-of-squared-digits map starting with n never reaches the number 1. The first few ...

A map f from a metric space M=(M,d) to a metric space N=(N,rho) is said to be uniformly continuous if for every epsilon>0, there exists a delta>0 such that ...

The de Longchamps circle is defined as the radical circle of the power circles of a given reference triangle. It is defined only for obtuse triangles. It is the complement of ...

The algorithm for the construction of a Gröbner basis from an arbitrary ideal basis. Buchberger's algorithm relies on the concepts of S-polynomial and polynomial reduction ...

A chamfered polyhedron, also known as an egde-truncated polyhedron, is a polyhedron constructed from an original polyhedron by moving faces outward while retaining the ...

The chromatic invariant theta(G) of a connected graph G is the number of spanning trees of G that have internal activity 1 and external activity 0. For graphs other than the ...

The maximum number of pieces into which a cylinder can be divided by n oblique cuts is given by f(n) = (n+1; 3)+n+1 (1) = 1/6(n+1)(n^2-n+6) (2) = 1/6(n^3+5n+6), (3) where (a; ...