Search Results for ""

The connective in logic corresponding to the exclusive nor operation. A XNOR B is equivalent to (A ^ B) v (!A ^ !B), where ^ denotes AND, v denotes OR, and !A denotes NOT. ...

The connective in logic corresponding to the exclusive nor operation. A XNOR B is equivalent to (A ^ B) v (!A ^ !B), where ^ denotes AND, v denotes OR, and !A denotes NOT. ...

A zero function is a function that is almost everywhere zero. The function sometimes known as "the zero function" is the constant function with constant c=0, i.e., f(x)=0 ...

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

In general, the external similitude center of two circles C_1=C(x_1,r_1) and C_2=C(x_2,r_2) with centers given in Cartesian coordinates is given by ...

The area of a surface or lamina is the amount of material needed to "cover" it completely. The area of a surface or collection of surfaces bounding a solid is called, not ...

A bicentric quadrilateral, also called a cyclic-inscriptable quadrilateral, is a four-sided bicentric polygon. The inradius r, circumradius R, and offset x are connected by ...

A dissection fallacy is an apparent paradox arising when two plane figures with different areas seem to be composed by the same finite set of parts. In order to produce this ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...