Search Results for ""

A group or other algebraic object is said to be Abelian (sometimes written in lower case, i.e., "abelian") if the law of commutativity always holds. The term is named after ...

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

As originally stated by Gould (1972), GCD{(n-1; k),(n; k-1),(n+1; k+1)} =GCD{(n-1; k-1),(n; k+1),(n+1; k)}, (1) where GCD is the greatest common divisor and (n; k) is a ...

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

_3F_2[n,-x,-y; x+n+1,y+n+1] =Gamma(x+n+1)Gamma(y+n+1)Gamma(1/2n+1)Gamma(x+y+1/2n+1) ×Gamma(n+1)Gamma(x+y+n+1)Gamma(x+1/2n+1)Gamma(y+1/2n+1), (1) where _3F_2(a,b,c;d,e;z) is a ...

For any M, there exists a t^' such that the sequence n^2+t^', where n=1, 2, ... contains at least M primes.

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 maximum cardinal number of a collection of subsets of a t-element set T, none of which contains another, is the binomial coefficient (t; |_t/2_|), where |_x_| is the ...