Search Results for ""

For N=k·2^n+1 with k odd and 2^n>k, if there exists an integer a such that a^((N-1)/2)=-1 (mod N), then N is prime. A prime of this form is known as a Proth prime.

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 test which always identifies prime numbers correctly, but may incorrectly identify a composite number as a prime.

Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...

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.

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 binomial coefficient (N; k) is said to be exceptional if lpf(N; k)>N/k. The following table gives the exception binomial coefficients which are also good binomial ...

Given a factor a of a number n=ab, the cofactor of a is b=n/a. A different type of cofactor, sometimes called a cofactor matrix, is a signed version of a minor M_(ij) defined ...