Search Results for ""

The polynomials defined by B_(i,n)(t)=(n; i)t^i(1-t)^(n-i), (1) where (n; k) is a binomial coefficient. The Bernstein polynomials of degree n form a basis for the power ...

Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...

Cards are a set of n rectangular pieces of cardboard with markings on one side and a uniform pattern on the other. The collection of all cards is called a "deck," and a ...

Let {a_i}_(i=1)^n be a set of positive numbers. Then sum_(i=1)^n(a_1a_2...a_i)^(1/i)<=esum_(i=1)^na_i (which is given incorrectly in Gradshteyn and Ryzhik 2000). Here, the ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

The common logarithm is the logarithm to base 10. The notation logx is used by physicists, engineers, and calculator keypads to denote the common logarithm. However, ...

The complementary Bell numbers, also called the Uppuluri-Carpenter numbers, B^~_n=sum_(k=0)^n(-1)^kS(n,k) (1) where S(n,k) is a Stirling number of the second kind, are ...

Let X be a normed space, M and N be algebraically complemented subspaces of X (i.e., M+N=X and M intersection N={0}), pi:X->X/M be the quotient map, phi:M×N->X be the natural ...

A completely positive matrix is a real n×n square matrix A=(a_(ij)) that can be factorized as A=BB^(T), where B^(T) stands for the transpose of B and B is any (not ...

A series is said to be conditionally convergent iff it is convergent, the series of its positive terms diverges to positive infinity, and the series of its negative terms ...