Search Results for ""

The Dottie number is the name given by Kaplan (2007) to the unique real root of cosx=x (namely, the unique real fixed point of the cosine function), which is 0.739085... ...

A group G is a finite or infinite set of elements together with a binary operation (called the group operation) that together satisfy the four fundamental properties of ...

The hemicubical graph is the skeleton of the hemicube. It has 7 vertices, 11 edges, and 6 faces. It is implemented in the Wolfram Language as GraphData["HemicubicalGraph"].

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

A one-person game played on a rectangular lattice of lamps which can be turned on and off. A move consists of flipping a "switch" inside one of the squares, thereby toggling ...

The McGee graph is a cubic symmetric graph on 24 nodes and 36 edges which is the unique 7-cage graph. It can be constructed as the union of the two leftmost subgraphs ...

Let lambda_(m,n) be Chebyshev constants. Schönhage (1973) proved that lim_(n->infty)(lambda_(0,n))^(1/n)=1/3. (1) It was conjectured that the number ...

The n-pan graph is the graph obtained by joining a cycle graph C_n to a singleton graph K_1 with a bridge. The n-pan graph is therefore isomorphic with the (n,1)-tadpole ...

The paw graph is the 3-pan graph, which is also isomorphic to the (3,1)-tadpole graph. It is implemented in the Wolfram Language as GraphData["PawGraph"].

A periodic continued fraction is a continued fraction (generally a regular continued fraction) whose terms eventually repeat from some point onwards. The minimal number of ...