Search Results for ""

The truncated dodecahedron is the 32-faced Archimedean solid with faces 20{3}+12{10}. It is also uniform polyhedron with Maeder index 26 (Maeder 1997), Wenninger index 10 ...

A "weird number" is a number that is abundant (i.e., the sum of proper divisors is greater than the number) without being pseudoperfect (i.e., no subset of the proper ...

A connective in logic known as the "exclusive or," or exclusive disjunction. It yields true if exactly one (but not both) of two conditions is true. The XOR operation does ...

The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...

A base-b BBP-type formula is a convergent series formula of the type alpha=sum_(k=0)^infty(p(k))/(b^kq(k)) (1) where p(k) and q(k) are integer polynomials in k (Bailey 2000; ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...

In response to a letter from Goldbach, Euler considered sums of the form s_h(m,n) = sum_(k=1)^(infty)(1+1/2+...+1/k)^m(k+1)^(-n) (1) = ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...