Search Results for ""

Let a_n>=0 and suppose sum_(n=1)^inftya_ne^(-an)∼1/a as a->0^+. Then sum_(n<=x)a_n∼x as x->infty. This theorem is a step in the proof of the prime number theorem, but has ...

If the integral coefficients C_0, C_1, ..., C_(N-1) of the polynomial f(x)=C_0+C_1x+C_2x^2+...+C_(N-1)x^(N-1)+x^N are divisible by a prime number p, while the free term C_0 ...

An ANOVA in which the number of replicates (sets of identical observations) is restricted to be the same for each factor level (treatment group).

A catastrophe which can occur for one control factor and one behavior axis. It is the universal unfolding of the singularity f(x)=x^3 and has the equation F(x,u)=x^3+ux.

Increasing a plane figure's linear dimensions by a scale factor s increases the perimeter p^'->sp and the area A^'->s^2A.

To multiply the size of a d-D object by a factor a, c=a^d copies are required, and the quantity d=(lnc)/(lna) is called the similarity dimension.

A surface harmonic of degree l which is premultiplied by a factor r^l. Confusingly, solid harmonics are also known as "spherical harmonics" (Whittaker and Watson 1990, p. ...

Let X and Y be topological spaces. Then their join is the factor space X*Y=(X×Y×I)/∼, (1) where ∼ is the equivalence relation (x,y,t)∼(x^',y^',t^')<=>{t=t^'=0 and x=x^'; or ; ...

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Then {U_((n-(D/n))/2)=0 (mod n) when (Q/n)=1; V_((n-(D/n))/2)=D (mod n) when (Q/n)=-1, ...