Search Results for ""

"Q.E.D." (sometimes written "QED") is an abbreviation for the Latin phrase "quod erat demonstrandum" ("that which was to be demonstrated"), a notation which is often placed ...

"Q.E.F.," sometimes written "QEF," is an abbreviation for the Latin phrase "quod erat faciendum" ("that which was to be done"). It is a translation of the Greek words used by ...

For a braid with M strands, R components, P positive crossings, and N negative crossings, {P-N<=U_++M-R if P>=N; P-N<=U_-+M-R if P<=N, (1) where U_+/- are the smallest number ...

The Fritsch graph is the 9-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

Define the "information function" to be I=-sum_(i=1)^NP_i(epsilon)ln[P_i(epsilon)], (1) where P_i(epsilon) is the natural measure, or probability that element i is populated, ...

The volumes of any n n-dimensional solids can always be simultaneously bisected by a (n-1)-dimensional hyperplane. Proving the theorem for n=2 (where it is known as the ...

All closed surfaces, despite their seemingly diverse forms, are topologically equivalent to spheres with some number of handles or cross-caps. The traditional proof follows ...

The grid shading problem is the problem of proving the unimodality of the sequence {a_1,a_2,...,a_(mn)}, where for fixed m and n, a_i is the number of partitions of i with at ...

If f(z) is continuous in a region D and satisfies ∮_gammafdz=0 for all closed contours gamma in D, then f(z) is analytic in D. Morera's theorem does not require simple ...

The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...