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:
“Whatever your hand finds to do, do with your might; for there is no work or thought or knowledge or wisdom in Sheol, to which you are going.”
—Bible: Hebrew, Ecclesiastes 9:10.
“Nine-tenths of the value of a sense of humor in writing is not in the things it makes one write but in the things it keeps one from writing. It is especially valuable in this respect in serious writing, and no one without a sense of humor should ever write seriously. For without knowing what is funny, one is constantly in danger of being funny without knowing it.”
—Robert Benchley (1889–1945)
“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)