Re: GCD of polynomials

alvaro.begue_at_gmail.com
Date: 01/05/05 

Date: 5 Jan 2005 08:48:57 -0800

It looks just like Euclid's algorithm. Divide the largest by the
smallest and replace the largest with the remainder. When the remainder
is 0, the smallest is the gcd.

Relevant Pages

  • Re: Analysis ToolPak Function in VBA is sloooow
    ... the algorithm you offered is the best performer of all the solutions offered in this thread so far. ... Thus each scenario calls Totient(and therefore GCD) 1,000,000 times. ... Even after uncommenting the debug.print statements in ATP's native GCD function, timings were in the 80's. ... Dim Remainder As Long ...
    (microsoft.public.excel.programming)
  • Re: Advanced data structures
    ... An algorithm cannot say "Set N equal to ... remainders without an explicit "remainder" operation, ... unsigned int remainder(unsigned int val, unsigned int div) ...
    (comp.lang.c)
  • Re: Help with lists.
    ... Disregarding the choice of programming language, what algorithm might ... of which elements are to be deleted in the remainder of the list. ... If it has at least two later occurrences, ...
    (comp.lang.prolog)
  • Non-restoring binary square root and convergence
    ... For giggles I was playing around with the binary square-rooting algorithm. ... Some handle the determination of the next root bit by ... iteration where the derived root is 3, and the remainder is zero. ...
    (comp.programming)
  • Non-restoring binary square root and convergence
    ... For giggles I was playing around with the binary square-rooting algorithm. ... Some handle the determination of the next root bit by ... iteration where the derived root is 3, and the remainder is zero. ...
    (sci.math)