Search Results for ""

A multiple root is a root with multiplicity n>=2, also called a multiple point or repeated root. For example, in the equation (x-1)^2=0, 1 is multiple (double) root. If a ...

A number r is an nth root of unity if r^n=1 and a primitive nth root of unity if, in addition, n is the smallest integer of k=1, ..., n for which r^k=1.

A root having multiplicity n=1 is called a simple root. For example, f(z)=(z-1)(z-2) has a simple root at z_0=1, but g=(z-1)^2 has a root of multiplicity 2 at z_0=1, which is ...

The operation of taking an nth root of a number.

A principal nth root omega of unity is a root satisfying the equations omega^n=1 and sum_(i=0)^(n-1)omega^(ij)=0 for j=1, 2, ..., n. Therefore, every primitive root of unity ...

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...

Consider the process of taking a number, taking its digit sum, then adding the digits of numbers derived from it, etc., until the remaining number has only one digit. The ...

The root lattice of a semisimple Lie algebra is the discrete lattice generated by the Lie algebra roots in h^*, the dual vector space to the Cartan subalgebra.

A reduced root system is a root system R satisfying the additional property that, if alpha in R, then the only multiples of alpha in R are +/-alpha.

The nth roots of unity are roots e^(2piik/n) of the cyclotomic equation x^n=1, which are known as the de Moivre numbers. The notations zeta_k, epsilon_k, and epsilon_k, where ...