Search Results for ""

Newton's iteration is an algorithm for computing the square root sqrt(n) of a number n via the recurrence equation x_(k+1)=1/2(x_k+n/(x_k)), (1) where x_0=1. This recurrence ...

The covercosine, also called the coversed cosine, is a little-used trigonometric function defined by covercos(z) = vercos(1/2pi-z) (1) = 1+sinz, (2) where vercosz is the ...

The crossed trough is the surface z=x^2y^2. (1) The coefficients of its first fundamental form are E = 1+4x^2y^4 (2) F = 4x^3y^3 (3) G = 1+4x^4y^2 (4) and of the second ...

The formulas j_n(z) = z^n(-1/zd/(dz))^n(sinz)/z (1) y_n(z) = -z^n(-1/zd/(dz))^n(cosz)/z (2) for n=0, 1, 2, ..., where j_n(z) is a spherical Bessel function of the first kind ...

A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...

An acyclic graph is a graph having no graph cycles. Acyclic graphs are bipartite. A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is ...

The Andrews-Schur identity states sum_(k=0)^nq^(k^2+ak)[2n-k+a; k]_q =sum_(k=-infty)^inftyq^(10k^2+(4a-1)k)[2n+2a+2; n-5k]_q([10k+2a+2]_q)/([2n+2a+2]_q) (1) where [n; m]_q is ...

The binomial transform takes the sequence a_0, a_1, a_2, ... to the sequence b_0, b_1, b_2, ... via the transformation b_n=sum_(k=0)^n(-1)^(n-k)(n; k)a_k. The inverse ...

The finite group C_2×C_6 is the finite group of order 12 that is the group direct product of the cyclic group C2 and cyclic group C6. It is one of the two Abelian groups of ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...