Search Results for ""

For a set partition of n elements, the n-character string a_1a_2...a_n in which each character gives the set block (B_0, B_1, ...) in which the corresponding element belongs ...

A figurate number which is constructed as a centered cube with a square pyramid appended to each face, RhoDod_n = CCub_n+6P_(n-1)^((4)) (1) = (2n-1)(2n^2-2n+1), (2) where ...

Riemann defined the function f(x) by f(x) = sum_(p^(nu)<=x; p prime)1/nu (1) = sum_(n=1)^(|_lgx_|)(pi(x^(1/n)))/n (2) = pi(x)+1/2pi(x^(1/2))+1/3pi(x^(1/3))+... (3) (Hardy ...

Let a closed interval [a,b] be partitioned by points a<x_1<x_2<...<x_(n-1)<b, where the lengths of the resulting intervals between the points are denoted Deltax_1, Deltax_2, ...

The study of manifolds having a complete Riemannian metric. Riemannian geometry is a general space based on the line element ds=F(x^1,...,x^n;dx^1,...,dx^n), with F(x,y)>0 ...

The time required for a given principal to double (assuming n=1 conversion period) for compound interest is given by solving 2P=P(1+r)^t, (1) or t=(ln2)/(ln(1+r)), (2) where ...

Also called "Ethiopian multiplication." To multiply two numbers a and b, write a_0=a and b_0=b in two columns. Under a_0, write |_a_0/2_|, where |_x_| is the floor function, ...

The S distribution is defined in terms of its distribution function F(x) as the solution to the initial value problem (dF)/(dx)=alpha(F^g-F^h), where F(x_0)=F_0 (Savageau ...

Let there be x successes out of n Bernoulli trials. The sample proportion is the fraction of samples which were successes, so p^^=x/n. (1) For large n, p^^ has an ...

A root-finding algorithm which assumes a function to be approximately linear in the region of interest. Each improvement is taken as the point where the approximating line ...