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:
“So long as you write what you wish to write, that is all that matters; and whether it matters for ages or only for hours, nobody can say. But to sacrifice a hair of the head of your vision, a shade of its colour, in deference to some Headmaster with a silver pot in his hand or to some professor with a measuring-rod up his sleeve, is the most abject treachery, and the sacrifice or wealth and chastity, which used to be said to be the greatest of human disasters, a mere flea-bite in comparison.”
—Virginia Woolf (1882–1941)
“All writing comes by the grace of God, and all doing and having.”
—Ralph Waldo Emerson (1803–1882)
“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)