Rational root theorem are found, they can be factored out of the polynomial, resulting in a polynomial of lower degree whose roots are also roots of the original polynomial. The general cubic equation with integer coefficients has three solutions in the complex plane. If it is found by the rational root test that there are no rational solutions, then the only way to express the solutions algebraically is to use cube roots. But if the test finds three rational solutions, then the cube roots are avoided. And if precisely one rational solution "r" is found to exist, then ("x" – "r") can be
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