Search Results for ""

Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...

A round number is a number that is the product of a considerable number of comparatively small factors (Hardy 1999, p. 48). Round numbers are very rare. As Hardy (1999, p. ...

Alpha is the name for the first letter in the Greek alphabet: alpha. In finance, alpha is a financial measure giving the difference between a fund's actual return and its ...

The expected value B_n(s) of r^s from a fixed vertex of a unit n-cube to a point picked at random in the interior of the hypercube is given by B_n(s) = ...

A contingency table, sometimes called a two-way frequency table, is a tabular mechanism with at least two rows and two columns used in statistics to present categorical data ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

The conditional intensity lambda(t) associated to a temporal point process N is defined to be the expected infinitesimal rate at which events are expected to occur around ...

The intensity measure mu of a point process X relative to a Borel set B subset R^d is defined to be the expected number of points of X falling in B. Symbolically, ...

The difference of a quantity from some fixed value, usually the "correct" or "expected" one.

Let N samples be taken from a population with central moments mu_n. The sample variance m_2 is then given by m_2=1/Nsum_(i=1)^N(x_i-m)^2, (1) where m=x^_ is the sample mean. ...