Search Results for ""

Mann's iteration is the dynamical system defined for a continuous function f:[0,1]->[0,1], x_n=1/nsum_(k=0)^(n-1)f(x_k) with x_0 in [0,1]. It can also be written ...

Let R(x) be the revenue for a production x, C(x) the cost, and P(x) the profit. Then P(x)=R(x)-C(x), and the marginal profit for the x_0th unit is defined by ...

In above figure, which constitutes a modified version of the painting Tirets by Francois Morellet, small circles seem to appear and disappear as the eye is moved over them.

For a given n, is the problem of determining if a set is mortal solvable? n=1 is solvable, n=2 is unknown, and n>=3 is unsolvable.

Polynomials s_k(x) which form the Sheffer sequence for f(t)=-(2t)/(1-t^2) (1) and have exponential generating function ...

A necessary and sufficient condition that [alpha^'] should be comparable with [alpha] for all positive values of the a is that one of (alpha^') and (alpha) should be ...

Generalizes the secant method of root finding by using quadratic 3-point interpolation q=(x_n-x_(n-1))/(x_(n-1)-x_(n-2)). (1) Then define A = ...

A natural transformation Phi={Phi_C:F(C)->D(C)} between functors F,G:C->D of categories C and D is said to be a natural isomorphism if each of the components is an ...

Four bits or half a byte, also sometimes spelled "nybble." Since a nibble encodes values from 0 to 2^4-1=15, it can conveniently be represented using a single hexadecimal ...

A group G is nilpotent if the upper central sequence 1=Z_0<=Z_1<=Z_2<=...<=Z_n<=... of the group terminates with Z_n=G for some n. Nilpotent groups have the property that ...