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:
“Then Moses stretched out his hand over the sea. The LORD drove the sea back by a strong east wind all night, and turned the sea into dry land; and the waters were divided. The Israelites went into the sea on dry ground, the waters forming a wall for them on their right and on their left.”
—Bible: Hebrew, Exodus 14:21,22.
“When, said Mr. Phillips, he communicated to a New Bedford audience, the other day, his purpose of writing his life, and telling his name, and the name of his master, and the place he ran from, the murmur ran round the room, and was anxiously whispered by the sons of the Pilgrims, “He had better not!” and it was echoed under the shadow of the Concord monument, “He had better not!””
—Henry David Thoreau (1817–1862)
“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)