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
Doubling the cube was the discovery by Hippocrates of Chios that it is equivalent to finding two mean proportionals between a line segment and another with twice the length. In modern notation, this means that given segments of lengths and , the duplication of the cube is equivalent to finding segments of lengths and so that In turn, this means that But Pierre Wantzel proved in 1837 that the cube root of 2 is not constructible; that is, it cannot be constructed with straightedge and compass. Menaechmus' original solution involves the intersection of two conic curves. Other more complicated methods of doubling the