Search Results for ""

The two recursive sequences U_n = mU_(n-1)+U_(n-2) (1) V_n = mV_(n-1)+V_(n-2) (2) with U_0=0, U_1=1 and V_0=2, V_1=m, can be solved for the individual U_n and V_n. They are ...

A sequence of polynomials p_n satisfying the identities p_n(x+y)=sum_(k>=0)(n; k)p_k(x)p_(n-k)(y).

The ordinary differential equation (y^')^m=f(x,y) (Hille 1969, p. 675; Zwillinger 1997, p. 120).

A ruled surface M is said to be a binormal developable of a curve y if M can be parameterized by x(u,v)=y(u)+vB^^(u), where B is the binormal vector.

The image of A_5×A_5 in the special orthogonal group SO(4), where A_5 is the icosahedral group.

Two adjoined rotundas.

A square matrix is called bisymmetric if it is both centrosymmetric and either symmetric or antisymmetric (Muir 1960, p. 19).

The smallest unit of binary information, equal to a single 0 or 1. Two bits are called a crumb, four bits are called a nibble, and eight bits are called 1 byte.

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

If the cross ratio kappa of {AB,CD} satisfy kappa^2-kappa+1=0, (1) then the points are said to form a bivalent range, and {AB,CD}={AC,DB}={AD,BC}=kappa (2) ...