Nth root Nth root In mathematics, an "n"th root of a number "x", where "n" is usually assumed to be a positive integer, is a number "r" which, when raised to the power "n" yields "x": where "n" is the "degree" of the root. A root of degree 2 is called a "square root" and a root of degree 3, a "cube root". Roots of higher degree are referred by using ordinal numbers, as in "fourth root", "twentieth root", etc. For example: Any non-zero number, considered as complex number, has "n" different "complex roots of degree "n"" ("n"th roots), including those with
Partial cube root vertex "r" for the tree, arbitrarily, and label each vertex "v" with a string of "m" bits that has a 1 in position "i" whenever edge "i" lies on the path from "r" to "v" in "T". For instance, "r" itself will have a label that is all zero bits, its neighbors will have labels with a single 1-bit, etc. Then the Hamming distance between any two labels is the distance between the two vertices in the tree, so this labeling shows that "T" is a partial cube. Every hypercube graph is itself a partial cube, which can be