Search Results for ""

A quadratic equation is a second-order polynomial equation in a single variable x ax^2+bx+c=0, (1) with a!=0. Because it is a second-order polynomial equation, the ...

A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...

The number obtained by adding the reciprocals of the odd twin primes, B=(1/3+1/5)+(1/5+1/7)+(1/(11)+1/(13))+(1/(17)+1/(19))+.... (1) By Brun's theorem, the series converges ...

If f(x,y) is an analytic function in a neighborhood of the point (x_0,y_0) (i.e., it can be expanded in a series of nonnegative integer powers of (x-x_0) and (y-y_0)), find a ...

Let X and Y be CW-complexes and let X_n (respectively Y_n) denote the n-skeleton of X (respectively Y). Then a continuous map f:X->Y is said to be cellular if it takes ...

A compositeness certificate is a piece of information which guarantees that a given number p is composite. Possible certificates consist of a factor of a number (which, in ...

The highest power in a univariate polynomial is known as its degree, or sometimes "order." For example, the polynomial P(x)=a_nx^n+...+a_2x^2+a_1x+a_0 is of degree n, denoted ...

A rigorous mathematical argument which unequivocally demonstrates the truth of a given proposition. A mathematical statement that has been proven is called a theorem. ...

A quantified system of real algebraic equations and inequalities in variables {x_1,...,x_n} is an expression QS=Q_1(y_1)Q_2(y_2)...Q_m(y_m)S(x_1,...,x_n;y_1,...,y_m), where Q ...

A generalization of Ramsey theory to mathematical objects in which one would not normally expect structure to be found. For example, there exists a graph with very few ...