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:
“Mrs. Zajac knows you didn’t try. You don’t just hand in junk to Mrs. Zajac. She’s been teaching an awful lot of years. She didn’t fall off the turnip cart yesterday. She told you she was an old-lady teacher.”
—Christine Zajac, U.S. fifth-grade teacher. As quoted in Among Schoolchildren, “September” section, part 1, by Tracy Kidder (1989)
“The writer who loses his self-doubt, who gives way as he grows old to a sudden euphoria, to prolixity, should stop writing immediately: the time has come for him to lay aside his pen.”
—Colette [Sidonie Gabrielle Colette] (1873–1954)
“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)