Search Results for ""

The conjecture that Frey's elliptic curve was not modular. The conjecture was quickly proved by Ribet (Ribet's theorem) in 1986, and was an important step in the proof of ...

A distribution of error such that the error remaining is always given approximately by the last term dropped.

An endomorphism is called ergodic if it is true that T^(-1)A=A implies m(A)=0 or 1, where T^(-1)A={x in X:T(x) in A}. Examples of ergodic endomorphisms include the map X->2x ...

The kurtosis excess of a distribution is sometimes called the excess, or excess coefficient. In graph theory, excess refers to the quantity e=n-n_l(v,g) (1) for a v-regular ...

F_x[cos(2pik_0x)](k) = int_(-infty)^inftye^(-2piikx)((e^(2piik_0x)+e^(-2piik_0x))/2)dx (1) = 1/2int_(-infty)^infty[e^(-2pii(k-k_0)x)+e^(-2pii(k+k_0)x)]dx (2) = ...

F_x[1/pi(1/2Gamma)/((x-x_0)^2+(1/2Gamma)^2)](k)=e^(-2piikx_0-Gammapi|k|). This transform arises in the computation of the characteristic function of the Cauchy distribution.

If x_1<x_2<...<x_n denote the zeros of p_n(x), there exist real numbers lambda_1,lambda_2,...,lambda_n such that ...

2^(30)=1024^3=1073741824 bytes. Although the term gigabyte is sometimes used to refer to 1024^3 bytes, such usage is deprecated in favor of the standard SI naming convention ...

The hazard function (also known as the failure rate, hazard rate, or force of mortality) h(x) is the ratio of the probability density function P(x) to the survival function ...

In a chain complex of modules ...->C_(i+1)->^(d_(i+1))C_i->^(d_i)C_(i-1)->..., the module B_i of i-boundaries is the image of d_(i+1). It is a submodule of C_i and is ...