Search Results for ""

If a_1, a_2, a_3, ... is an artistic sequence, then 1/a_1, 1/a_2, 1/a_3, ... is a melodic sequence. The recurrence relation obeyed by melodic series is ...

A group G such that the quotient group G/Z(G), where Z(G) is the group center of G, is Abelian. An equivalent condition is that the commutator subgroup G^' is contained in ...

Metamathematics is another word for proof theory. The branch of logic dealing with the study of the combination and application of mathematical symbols is also sometimes ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

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

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

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

The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...