Calculating HCF
Hey, this is more of a maths question than it is programming but I know how good you lot are at maths so I thought I would ask...
My brother is doing applications for jobs whereby he has to complete tests - one of them being numerical. One of the questions was to do with HCF and obviously the normal method would be to jus write out all multiples, see what ones are common, and then find the highest. This question however was dealing with 5/6 digit numbers... Was wondering if there was any formaula that can be used?
My brother is doing applications for jobs whereby he has to complete tests - one of them being numerical. One of the questions was to do with HCF and obviously the normal method would be to jus write out all multiples, see what ones are common, and then find the highest. This question however was dealing with 5/6 digit numbers... Was wondering if there was any formaula that can be used?
http://en.wikipedia.org/wiki/Euclidean_algorithm
I just googled "highest common factor algorithms"
| In mathematics, the Euclidean algorithm[a] (also called Euclid's algorithm) is an efficient method for computing the greatest common divisor (GCD), also known as the greatest common factor (GCF) or highest common factor (HCF). It is named after the Greek mathematician Euclid, who described it in Books VII and X of his Elements. |
I just googled "highest common factor algorithms"
Topic archived. No new replies allowed.