Search Results for ""

The triangular snake graph TS_n is the graph on n vertices with n odd defined by starting with the path graph P_(n-1) and adding edges (2i-1,2i+1) for i=1, ..., n-1. The ...

A triangle in which all three angles are acute angles. A triangle which is neither acute nor a right triangle (i.e., it has an obtuse angle) is called an obtuse triangle. ...

The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by ...

The harmonic mean H(x_1,...,x_n) of n numbers x_i (where i=1, ..., n) is the number H defined by 1/H=1/nsum_(i=1)^n1/(x_i). (1) The harmonic mean of a list of numbers may be ...

A number of attractive polyhedron compounds consisting of three octahedra. The first (left figues) is the polyhedron dual of the cube 3-compound. These compounds will be ...

There are a number of attractive compounds of two regular tetrahedra. The most symmetrical is the arrangement whose outer hull is the stella octangula (left figure), while ...

Hoggatt and Denman (1961) showed that any obtuse triangle can be divided into eight acute isosceles triangles. There are 1, 4, 23, 180, 1806, 20198, ... (OEIS A056814) ...

Voronin (1975) proved the remarkable analytical property of the Riemann zeta function zeta(s) that, roughly speaking, any nonvanishing analytic function can be approximated ...

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...