Search Results for ""

There are two different statements, each separately known as the greatest common divisor theorem. 1. Given positive integers m and n, it is possible to choose integers x and ...

The number of real roots of an algebraic equation with real coefficients whose real roots are simple over an interval, the endpoints of which are not roots, is equal to the ...

Given an m×n matrix A, the fundamental theorem of linear algebra is a collection of results relating various properties of the four fundamental matrix subspaces of A. In ...

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) ...

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 ...

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) = ...

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 ...

Let P=a_1x+a_2x^2+... be an almost unit in the integral domain of formal power series (with a_1!=0) and define P^k=sum_(n=k)^inftya_n^((k))x^n (1) for k=+/-1, +/-2, .... If ...

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 ...