Search Results for ""

The von Staudt-Clausen theorem, sometimes also known as the Staudt-Clausen theorem (Carlitz 1968), states that B_(2n)=A_n-sum_(p_k; (p_k-1)|2n)1/(p_k), (1) where B_(2n) is a ...

A circle is the set of points in a plane that are equidistant from a given point O. The distance r from the center is called the radius, and the point O is called the center. ...

In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...

The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...

Inversion is the process of transforming points P to a corresponding set of points P^' known as their inverse points. Two points P and P^' are said to be inverses with ...

Roughly speaking, the metric tensor g_(ij) is a function which tells how to compute the distance between any two points in a given space. Its components can be viewed as ...

The power tower of order k is defined as a^^k=a^(a^(·^(·^(·^a))))_()_(k), (1) where ^ is Knuth up-arrow notation (Knuth 1976), which in turn is defined by ...

A quadrilateral, sometimes also known as a tetragon or quadrangle (Johnson 1929, p. 61) is a four-sided polygon. If not explicitly stated, all four polygon vertices are ...

Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...