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:
“The hand holds no chalk
And each part of the whole falls off
And cannot know it knew, except
Here and there, in cold pockets
Of remembrance, whispers out of time.”
—John Ashbery (b. 1927)
“... in writing you cannot possibly be interesting if what you say is not true, if it is what I call “a true lie,” i.e., a truth which gives the wrong impression. For no matter how subtly you lie in writing, people know it and don’t believe you, and the whole secret of being interesting is to be believed.”
—Brenda Ueland (1891–1985)
“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)