Search Results for ""

If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...

The most general form of this theorem states that in a commutative unit ring R, the height of every proper ideal I generated by n elements is at most n. Equality is attained ...

Euler's 6n+1 theorem states that every prime of the form 6n+1, (i.e., 7, 13, 19, 31, 37, 43, 61, 67, ..., which are also the primes of the form 3n+1; OEIS A002476) can be ...

Relates evolutes to single paths in the calculus of variations. Proved in the general case by Darboux and Zermelo in 1894 and Kneser in 1898. It states: "When a single ...

The theorem, originally conjectured by Berge (1960, 1961), that a graph is perfect iff neither the graph nor its graph complement contains an odd graph cycle of length at ...

The asymptotic form of the n-step Bernoulli distribution with parameters p and q=1-p is given by P_n(k) = (n; k)p^kq^(n-k) (1) ∼ 1/(sqrt(2pinpq))e^(-(k-np)^2/(2npq)) (2) ...

The important property of Fourier transforms that F_x[cos(2pik_0x)f(x)](k) can be expressed in terms of F[f(x)]=F(k) as follows, ...

Every continuous linear functional U[f] for f in C[a,b] can be expressed as a Stieltjes integral U[f]=int_a^bf(x)dw(x), where w(x) is determined by U and is of bounded ...

Recall the definition of the autocorrelation function C(t) of a function E(t), C(t)=int_(-infty)^inftyE^_(tau)E(t+tau)dtau. (1) Also recall that the Fourier transform of E(t) ...

Let f*g denote the cross-correlation of functions f(t) and g(t). Then f*g = int_(-infty)^inftyf^_(tau)g(t+tau)dtau (1) = ...