Search Results for ""

The series with sum sum_(n=0)^infty1/(F_(2^n))=1/2(7-sqrt(5)), where F_k is a Fibonacci number (Honsberger 1985).

The number 1000000=10^6. While one million in the "American" system of numbers means the same thing as one million in the "British" system, the words billion, trillion, etc., ...

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...

A matrix with 0 determinant whose determinant becomes nonzero when any element on or below the diagonal is changed from 0 to 1. An example is M=[1 -1 0 0; 0 0 -1 0; 1 1 1 -1; ...

The minimal residue of a (mod m) is the value b or b-m, whichever is smaller in absolute value, where a=b (mod m). If m=2b (so that b=|b-m|), then the minimal residue is ...

Given a collection of sets, a member set that is not a proper subset of another member set is called a minimal set. Minimal sets are important in graph theory, since many ...

A minimal vertex cut is an vertex cut of a graph that is not a proper subset of any other vertex cut. Every minimum vertex cut is a minimal vertex cut, but the converse does ...

The approximating polynomial which has the smallest maximum deviation from the true function. It is closely approximated by the Chebyshev polynomials of the first kind.

A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number. Note that while a ...

A minimum dominating set is a dominating set of smallest size in a given graph. The size of a minimum dominating set is known as the domination number of the graph. A minimum ...