Search Results for ""

If replacing each number by its square in a magic square produces another magic square, the square is said to be a bimagic square. Bimagic squares are also called doubly ...

The Brouwer-Haemers graph is the unique strongly regular graph on 81 vertices with parameters nu=81, k=20, lambda=1, mu=6 (Brouwer and Haemers 1992, Brouwer). It is also ...

The Buffon-Laplace needle problem asks to find the probability P(l,a,b) that a needle of length l will land on at least one line, given a floor with a grid of equally spaced ...

The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

A class of complete orientable minimal surfaces of R^3 derived from Enneper's minimal surface. They are named for the mathematicians who found the first two examples in 1982. ...

If Y_i have normal independent distributions with mean 0 and variance 1, then chi^2=sum_(i=1)^rY_i^2 (1) is distributed as chi^2 with r degrees of freedom. This makes a chi^2 ...

A chordless cycle of a graph G is a graph cycle in G that has no cycle chord. Unfortunately, there are conflicting conventions on whether or not 3-cycles should be considered ...

Let P(G) denote the chromatic polynomial of a finite simple graph G. Then G is said to be chromatically unique if P(G)=P(H) implies that G and H are isomorphic graphs, in ...

The power of a fixed point A with respect to a circle of radius r and center O is defined by the product p=AP×AQ, (1) where P and Q are the intersections of a line through A ...