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:
“We unlearn. I am a shore
rocking you off. You break from me. I choose
your only way, my small inheritor
and hand you off, trembling the selves we lose.
Go child, who is my sin and nothing more.”
—Anne Sexton (1928–1974)
“I am carrying out my plan, so long formulated, of keeping a journal. What I most keenly wish is not to forget that I am writing for myself alone. Thus I shall always tell the truth, I hope, and thus I shall improve myself. These pages will reproach me for my changes of mind.”
—Eugène Delacroix (1798–1863)
“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)