Search Results for ""

The Simson cubic is the triangle cubic that is the locus of tripoles of the Simson lines of a triangle DeltaABC. It has trilinear equation ...

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

A negative number multiplied by another negative number gives a positive number.

The number of bases in which 1/p is a repeating decimal (actually, repeating b-ary) of length l is the same as the number of fractions 0/(p-1), 1/(p-1), ..., (p-2)/(p-1) ...

The Golomb graph is a unit-distance graph discovered around 1960-1965 by Golomb (Soifer 2008, p. 19). It is implemented in the Wolfram Language as GraphData["GolombGraph"]. A ...

A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...

Tietze's graph is the cubic graph on 12 nodes and 18 edges illustrated above in a number of embeddings. It is implemented in the Wolfram Language as GraphData["TietzeGraph"]. ...

The rook is a chess piece that may move any number of spaces either horizontally or vertically per move. The maximum number of nonattacking rooks that may be placed on an n×n ...

The m×n king graph is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a king. The number ...

The smallest positive composite number and the first even perfect square. Four is the smallest even number appearing in a Pythagorean triple: 3, 4, 5. In the numerology of ...