Search Results for ""

The number of ways to arrange n distinct objects along a fixed (i.e., cannot be picked up out of the plane and turned over) circle is P_n=(n-1)!. The number is (n-1)! instead ...

Clairaut's difference equation is a special case of Lagrange's equation (Sokolnikoff and Redheffer 1958) defined by u_k=kDeltau_k+F(Deltau_k), (1) or in "x notation," ...

y=x(dy)/(dx)+f((dy)/(dx)) (1) or y=px+f(p), (2) where f is a function of one variable and p=dy/dx. The general solution is y=cx+f(c). (3) The singular solution envelopes are ...

The classification theorem of finite simple groups, also known as the "enormous theorem," which states that the finite simple groups can be classified completely into 1. ...

The downward Clenshaw recurrence formula evaluates a sum of products of indexed coefficients by functions which obey a recurrence relation. If f(x)=sum_(k=0)^Nc_kF_k(x) (1) ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

A closed sentential formula is a sentential formula in which none of the variables are free (i.e., all variables are bound). Examples of closed sentential formulas are given ...

The coboundary polynomial chi^__G(q,t) is a bivariate graph polynomial which can be expressed in terms of the Tutte polynomial T_G(x,y) of a graph G by ...

A coequalizer of a pair of maps f,g:X->Y in a category is a map c:Y->C such that 1. c degreesf=c degreesg, where degrees denotes composition. 2. For any other map c^':Y->C^' ...

A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...