Search Results for ""

A set of six.

The point of concurrence of the six planes in Monge's tetrahedron theorem.

The probability of getting at least one "6" in four rolls of a single 6-sided die is 1-(5/6)^4 approx 0.5177, (1) which is slightly higher than the probability of at least ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

Cayley's cubic surface is the unique cubic surface having four ordinary double points (Hunt), the maximum possible for cubic surface (Endraß). The Cayley cubic is invariant ...

Let (P,B) denote a configuration with v points P={p_1,...,p_v} and b lines ("blocks") B=(B_1,...,B_b). Then the Levi graph L(P,B), also called the incidence graph, of a ...

An algebraic surface of order 3. Schläfli and Cayley classified the singular cubic surfaces. On the general cubic, there exists a curious geometrical structure called double ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

A roll of eight on a pair of six-sided dice in the game of craps. The probability of rolling "eighter from Decatur" is 5/36, or 13.888...%.

A curve created by starting with a circle, dividing it into six arcs, and flipping three alternating arcs. The process is then repeated an infinite number of times.