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:
“It is fair to assume that when women in the past have achieved even a second or third place in the ranks of genius they have shown far more native ability than men have needed to reach the same eminence. Not excused from the more general duties that constitute the cement of society, most women of talent have had but one hand free with which to work out their ideal conceptions.”
—Anna Garlin Spencer (1851–1931)
“Faithfulness to the past can be a kind of death above ground. Writing of the past is a resurrection; the past then lives in your words and you are free.”
—Jessamyn West (1902–1984)
“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)