Search Results for ""

The orchard-planting problem (also known as the orchard problem or tree-planting problem) asks that n trees be planted so that there will be r(n,k) straight rows with k trees ...

Suppose that A is a Banach algebra and X is a Banach A-bimodule. For n=0, 1, 2, ..., let C^n(A,X) be the Banach space of all bounded n-linear mappings from A×...×A into X ...

Let T(x,y,z) be the number of times "otherwise" is called in the TAK function, then the Takeuchi numbers are defined by T_n(n,0,n+1). A recursive formula for T_n is given by ...

Given a function f(x), its inverse f^(-1)(x) is defined by f(f^(-1)(x))=f^(-1)(f(x))=x. (1) Therefore, f(x) and f^(-1)(x) are reflections about the line y=x. In the Wolfram ...

In database structures, two quantities are generally of interest: the average number of comparisons required to 1. Find an existing random record, and 2. Insert a new random ...

A presheaf C of categories consists of the following data: 1. For every local homeomorphism f:Y->X of topological spaces X, Y, a category C(f:Y->X); 2. For every diagram f ...

The discrete uniform distribution is also known as the "equally likely outcomes" distribution. Letting a set S have N elements, each of them having the same probability, then ...

Let alpha(x) be a step function with the jump j(x)=(N; x)p^xq^(N-x) (1) at x=0, 1, ..., N, where p>0,q>0, and p+q=1. Then the Krawtchouk polynomial is defined by ...

Analytic representations the symmetric triangle wave with period 2 and varying between -1 and 1 include f(x) = 2/pisin^(-1)[sin(pix)] (1) = 1-2|1-[2(1/2x+1/4 (mod 1))]| (2) = ...

The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...