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:
“All the old supports going, gone, this man reaches out a hand to steady himself on a ledge of rough brick that is warm in the sun: his hand feeds him messages of solidity, but his mind messages of destruction, for this breathing substance, made of earth, will be a dance of atoms, he knows it, his intelligence tells him so: there will soon be war, he is in the middle of war, where he stands will be a waste, mounds of rubble, and this solid earthy substance will be a film of dust on ruins.”
—Doris Lessing (b. 1919)
“I write to you out of turn, and believe I must adopt the rule of only writing when I am written to, in hopes that may provoke more frequent letters.”
—Thomas Jefferson (1743–1826)
“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)