Search Results for ""

Typesetting "errors" in which exponents or multiplication signs are omitted but the resulting expression is equivalent to the original one. Examples include 2^59^2=2592 (1) ...

A rook polynomial is a polynomial R_(m,n)(x)=sum_(k=0)^(min(m,n))r_kx^k (1) whose number of ways k nonattacking rooks can be arranged on an m×n chessboard. The rook ...

There are a number of interesting results related to the tiling of squares. For example, M. Laczkovich has shown that there are exactly three shapes of non-right triangles ...

The superfactorial of n is defined by Pickover (1995) as n$=n!^(n!^(·^(·^(·^(n!)))))_()_(n!). (1) The first two values are 1 and 4, but subsequently grow so rapidly that 3$ ...

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...

The Stieltjes integral is a generalization of the Riemann integral. Let f(x) and alpha(x) be real-valued bounded functions defined on a closed interval [a,b]. Take a ...

Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...

A permutation problem invented by Cayley. Let the numbers 1, 2, ..., n be written on a set of cards, and shuffle this deck of cards. Now, start counting using the top card. ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...