GCD By Hand Writing Computation
There are several ways to find the greatest common divisor of two polynomials. Two of them are:
- Factorization, in which one finds the factors of each expression, then selects the set of common factors held by all from within each set of factors. This method may be useful only in very simple cases, as, like for the integers, factoring is usually much more difficult than computing the greatest common divisor. Moreover, there are fields of coefficient for which there is no factorization algorithm, while Euclidean algorithm always exists.
- The Euclidean algorithm, which can be used to find the GCD of two polynomials in the same manner as for two numbers.
Read more about this topic: Greatest Common Divisor Of Two Polynomials
Famous quotes containing the words hand, writing and/or computation:
“It is impossible, as impossible as to raise the dead, to restore anything that has ever been great or beautiful in architecture. That which I have ... insisted upon as the life of the whole, that spirit which is given only by the hand and eye of the workman, can never be recalled.”
—John Ruskin (1819–1900)
“One can write out of love or hate. Hate tells one a great deal about a person. Love makes one become the person. Love, contrary to legend, is not half as blind, at least for writing purposes, as hate. Love can see the evil and not cease to be love. Hate cannot see the good and remain hate. The writer, writing out of hatred, will, thus, paint a far more partial picture than if he had written out of love.”
—Jessamyn West (1902–1984)
“I suppose that Paderewski can play superbly, if not quite at his best, while his thoughts wander to the other end of the world, or possibly busy themselves with a computation of the receipts as he gazes out across the auditorium. I know a great actor, a master technician, can let his thoughts play truant from the scene ...”
—Minnie Maddern Fiske (1865–1932)