Search Results for ""

A Mersenne number is a number of the form M_n=2^n-1, (1) where n is an integer. The Mersenne numbers consist of all 1s in base-2, and are therefore binary repunits. The first ...

A partition is a way of writing an integer n as a sum of positive integers where the order of the addends is not significant, possibly subject to one or more additional ...

A permutation cycle is a subset of a permutation whose elements trade places with one another. Permutations cycles are called "orbits" by Comtet (1974, p. 256). For example, ...

A short mnemonic for remembering the first seven decimal digits of pi is "How I wish I could calculate pi" (C. Heckman, pers. comm., Feb. 3, 2005). Eight digits are given by ...

A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...

The Steiner circumellipse is the circumellipse that is the isotomic conjugate of the line at infinity and the isogonal conjugate of the Lemoine axis. It has circumconic ...

There are (at least) three different types of points known as Steiner points. The point S of concurrence of the three lines drawn through the vertices of a triangle parallel ...

Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...

The base-3 method of counting in which only the digits 0, 1, and 2 are used. Ternary numbers arise in a number of problems in mathematics, including some problems of ...

The truncated Witt graph is the graph on 506 vertices related to a 4-(23,8,4) design (Brouwer et al. 1989, p. 367). It is called the M_(23) graph by van Dam and Haemers ...