Search Results for ""

A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...

A generalization of Fermat's last theorem which states that if a^x+b^y=c^z, where a, b, c, x, y, and z are any positive integers with x,y,z>2, then a, b, and c have a common ...

An interpolation formula, sometimes known as the Newton-Bessel formula, given by (1) for p in [0,1], where delta is the central difference and B_(2n) = 1/2G_(2n) (2) = ...

The Brocard inellipse is the inconic with parameters x:y:z=1/a:1/b:1/c, (1) giving the trilinear equation ...

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...

An algorithm which finds rational function extrapolations of the form R_(i(i+1)...(i+m))=(P_mu(x))/(P_nu(x))=(p_0+p_1x+...+p_mux^mu)/(q_0+q_1x+...+q_nux^nu) and can be used ...

Let A and B be any sets, and let |X| be the cardinal number of a set X. Then cardinal exponentiation is defined by |A|^(|B|)=|set of all functions from B into A| (Ciesielski ...

Cauchy conditions are initial conditions (time conditions) rather than boundary conditions (space conditions). An initial-value problem is often termed a Cauchy problem. ...

If the four points making up a quadrilateral are joined pairwise by six distinct lines, a figure known as a complete quadrangle results. A complete quadrangle is therefore a ...

A measure which takes values in the complex numbers. The set of complex measures on a measure space X forms a vector space. Note that this is not the case for the more common ...