Search Results for ""

Backgammon is a board game played by two players. The backgammon board is divided into four sections of six triangular regions on which pieces may be placed. Brown and white ...

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 method which can be used to solve some classes of integral equations and is especially useful in implementing certain types of data inversion. It has been applied to invert ...

The backward difference is a finite difference defined by del _p=del f_p=f_p-f_(p-1). (1) Higher order differences are obtained by repeated operations of the backward ...

Every irrational number x has an approximation constant c(x) defined by c(x)=lim inf_(q->infty)q|qx-p|, where p=nint(qx) is the nearest integer to qx and lim inf is the ...

A Bäcklund transformation allows additional solutions to a nonlinear partial differential equations to be found if one particular solution is already known.

Baer's criterion, also known as Baer's test, states that a module M over a unit ring R is injective iff every module homomorphism from an ideal of R to M can be extended to a ...

If, for n>=0, beta_n=sum_(r=0)^n(alpha_r)/((q;q)_(n-r)(aq;q)_(n+r)), (1) then beta_n^'=sum_(r=0)^n(alpha_r^')/((q;q)_(n-r)(aq;q)_(n+r)), (2) where alpha_r^' = ...

The map x_(n+1)=2mux_n, (1) where x is computed modulo 1. A generalized Baker's map can be defined as x_(n+1) = {lambda_ax_n y_n<alpha ; (1-lambda_b)+lambda_bx_n y_n>alpha ...

Consider an infinite repository containing balls of n different types. Then the following table summarizes the number of distinct ways in which k balls can be picked for four ...