In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalised version of the familiar arithmetic technique called long division. It can be done easily by hand, because it separates an otherwise complex division problem into smaller ones.
Polynomial long division is an algorithm that implement the Euclidean division of polynomials, which starting from two polynomials A (the dividend) and B (the divisor) produces, if B is not zero, a quotient Q and a remainder R such that
- A = BQ + R,
and either R = 0 or the degree of R is lower than the degree of B. These conditions define uniquely Q and R, which means that Q and R do not depend on the method used to compute them.
Read more about Polynomial Long Division: Example, Pseudo-code, Euclidean Division
Famous quotes containing the words long and/or division:
“I have seen in this revolution a circular motion of the sovereign power through two usurpers, father and son, to the late King to this his son. For ... it moved from King Charles I to the Long Parliament; from thence to the Rump; from the Rump to Oliver Cromwell; and then back again from Richard Cromwell to the Rump; then to the Long Parliament; and thence to King Charles, where long may it remain.”
—Thomas Hobbes (1579–1688)
“If the technology cannot shoulder the entire burden of strategic change, it nevertheless can set into motion a series of dynamics that present an important challenge to imperative control and the industrial division of labor. The more blurred the distinction between what workers know and what managers know, the more fragile and pointless any traditional relationships of domination and subordination between them will become.”
—Shoshana Zuboff (b. 1951)