Root-finding algorithm cubic polynomial may involve non-real cube roots). For polynomials of degree five or higher Abel–Ruffini theorem asserts that there is, in general, no radical expression of the roots. So, except for very low degrees, root finding of polynomials consists of finding approximations of the roots. By the fundamental theorem of algebra, one knows that a polynomial of degree has at most real or complex roots, and the this number is reached for almost all polynomials. It follows that the problem of root finding for polynomials may be split in three different subproblems; For finding one root, Newton's method and other
Cube only member of that group that is a zonohedron (every face has point symmetry). The cube can be cut into six identical square pyramids. If these square pyramids are then attached to the faces of a second cube, a rhombic dodecahedron is obtained (with pairs of coplanar triangles combined into rhombic faces). The analogue of a cube in four-dimensional Euclidean space has a special name—a tesseract or hypercube. More properly, a hypercube (or "n"-dimensional cube or simply "n"-cube) is the analogue of the cube in "n"-dimensional Euclidean space and a tesseract is the order-4 hypercube. A hypercube is also called