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 (algebra) if and only if one can arrange solid unit cubes into a larger, solid cube. For example, 27 small cubes can be arranged into one larger one with the appearance of a Rubik's Cube, since . The difference between the cubes of consecutive integers can be expressed as follows: or There is no minimum perfect cube, since the cube of a negative integer is negative. For example, . Unlike perfect squares, perfect cubes do not have a small number of possibilities for the last two digits. Except for cubes divisible by 5, where only 25, 75 and 00 can be