Search Results for ""

For discrete problems in which no efficient solution method is known, it might be necessary to test each possibility sequentially in order to determine if it is the solution. ...

If x_1<x_2<...<x_n denote the zeros of p_n(x), there exist real numbers lambda_1,lambda_2,...,lambda_n such that ...

A symmetric block design (4n+3, 2n+1, n) which is equivalent to a Hadamard matrix of order 4n+4. It is conjectured that Hadamard designs exist for all integers n>0, but this ...

In a lattice, any two elements a and b have a least upper bound. This least upper bound is often called the join of a and b, and is denoted by a v b. One can also speak of ...

A number triangle of order n with entries 1 to n such that entries are nondecreasing across rows and down columns and all entries in column j are less than or equal to j. An ...

In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...

The symbol +/- is used to denote a quantity which should be both added and subtracted, as in a+/-b. The symbol can be used to denote a range of uncertainty, or to denote a ...

A result in control theory. Define H(psi,x,u)=(psi,f(x,u))=sum_(a=0)^npsi_af^a(x,u). Then in order for a control u(t) and a trajectory x(t) to be optimal, it is necessary ...

A fractional integral of order 1/2. The semi-integral of t^lambda is given by D^(-1/2)t^lambda=(t^(lambda+1/2)Gamma(lambda+1))/(Gamma(lambda+3/2)), so the semi-integral of ...

Two distinct point pairs AC and BD separate each other if A, B, C, and D lie on a circle (or line) in such order that either of the arcs (or the line segment AC) contains one ...