Search Results for ""

The von Staudt-Clausen theorem, sometimes also known as the Staudt-Clausen theorem (Carlitz 1968), states that B_(2n)=A_n-sum_(p_k; (p_k-1)|2n)1/(p_k), (1) where B_(2n) is a ...

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...

The m×n queen graph Q_(m,n) 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 queen. ...

Continuum percolation can be thought of as a continuous, uncountable version of percolation theory-a theory which, in its most studied form, takes place on a discrete, ...

The decimal expansion of the Golomb-Dickman constant is given by lambda=0.6243299885... (OEIS A084945). Mitchell (1968) computed lambda to 53 decimal places. lambda has been ...

The inverse hyperbolic cosecant csch^(-1)z (Zwillinger 1995, p. 481), sometimes called the area hyperbolic cosecant (Harris and Stocker 1998, p. 271) and sometimes denoted ...

In the plane, the reflection property can be stated as three theorems (Ogilvy 1990, pp. 73-77): 1. The locus of the center of a variable circle, tangent to a fixed circle and ...

The Riemann-Siegel formula is a formula discovered (but not published) by Riemann for computing an asymptotic formula for the Riemann-Siegel function theta(t). The formula ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...