Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Highest common factor question

  1. Jul 28, 2011 #1
    I was reading an older book on how to find the HCF and I wanted to know if it is a good technique or just a waste of time?

    Find the highest common factor of 4x^3 - 3x^2 - 24x - 9 and 8x^3 - 2x^2 - 53x - 39

    Is any one familiar with the method? Are there better methods out there?

    Thank you.

    Attached Files:

    • HCF.jpg
      File size:
      12.4 KB
  2. jcsd
  3. Jul 28, 2011 #2
    This looks like the Euclidean algorithm (http://en.wikipedia.org/wiki/Greatest_common_divisor_of_two_polynomials). If so, yes it's a very good way to find the highest common factor (also known as the greatest common divisor). If the polynomials are of small enough degree, you could alternatively try to factor them and then compare their factorizations. But I think the Euclidean algorithm is better for higher degree polynomials.
  4. Jul 28, 2011 #3


    User Avatar
    Homework Helper

    Last edited by a moderator: Apr 26, 2017
  5. Jul 28, 2011 #4


    User Avatar
    Staff Emeritus
    Science Advisor
    Gold Member

    Closed as a duplicate of the other question.
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook