Search Results for ""

A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.

The only linear associative algebra in which the coordinates are real numbers and products vanish only if one factor is zero are the field of real numbers, the field of ...

If the coefficients of the polynomial d_nx^n+d_(n-1)x^(n-1)+...+d_0=0 (1) are specified to be integers, then rational roots must have a numerator which is a factor of d_0 and ...

The divergence theorem, more commonly known especially in older literature as Gauss's theorem (e.g., Arfken 1985) and also known as the Gauss-Ostrogradsky theorem, is a ...

The converse of Fisher's theorem.

Writing a Fourier series as f(theta)=1/2a_0+sum_(n=1)^(m-1)sinc((npi)/(2m))[a_ncos(ntheta)+b_nsin(ntheta)], where m is the last term, reduces the Gibbs phenomenon. The ...

The hinge theorem says that if two triangles DeltaABC and DeltaA^'B^'C^' have congruent sides AB=A^'B^' and AC=A^'C^' and ∠A>∠A^', then BC>B^'C^'.

There are several theorems that generally are known by the generic name "Pappus's Theorem." They include Pappus's centroid theorem, the Pappus chain, Pappus's harmonic ...

Qualitatively, a deep theorem is a theorem whose proof is long, complicated, difficult, or appears to involve branches of mathematics which are not obviously related to the ...

The reciprocity theorem for x^8=q (mod p).