Search Results for ""

The conjecture that, for any triangle, 8omega^3<ABC (1) where A, B, and C are the vertex angles of the triangle and omega is the Brocard angle. The Abi-Khuzam inequality ...

The complete bipartite graph K_(1,3) is a tree known as the "claw." It is isomorphic to the star graph S_4, and is sometimes known as the Y graph (Horton and Bouwer 1991; ...

The number M_2(n) = 1/nsum_(k=1)^(n^2)k (1) = 1/2n(n^2+1) (2) to which the n numbers in any horizontal, vertical, or main diagonal line must sum in a magic square. The first ...

The mean tetrahedron volume of a tetrahedron with vertices chosen at random inside another tetrahedron of unit volume is given by V^_ = (13)/(720)-(pi^2)/(15015) (1) = ...

An n-trapezohedron, also called an antidipyramid, antibipyramid, or deltohedron (not to be confused with a deltahedron), is a solid composed of interleaved symmetric ...

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

A cubic triangular number is a positive integer that is simultaneously cubic and triangular. Such a number must therefore satisfy T_n=m^3 for some positive integers n and m, ...

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

For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...