We have that
And we know that:
Just found a method for you
Find the prime factors of both
Then, lets say one has prime factors of (making this up) 2x2 and 3x3 and 5 and the other has prime factors of 3 and 5x5 and 7
Now take the numbers from each one which are in most frequency. I know that sounded confusing, sorry.
Look at it this way, the first number has more 2s than the second, so we take 2x2, the first number also has more 3s so we take 3x3 from it but the third number has more 5s and 7s so we take 5x5 and 7 from it.
Multiply it all together and you get the HCF (2x2x3x3x5x5x7)
Sorry, thought you'd be familiar with these terms.hi what is gcd? and sorry... i didnt understand your workings
gcd = greatest common divisor,
lcm = lowest common multiple ( the one you need to find)
There's a theorem that states gcd(n,m)* lcm(n,m)=nm. A very useful thing, since you know what value gcd(n,m) is in this case.
For instance if you have 3 numbers, a,b and k. And k | a and k | b then k is a common divisor. The greatest common divisor speaks for itself then.. and its written GCD(a,b)
I'll give you an example:
Say we wanna find GCD(12,30) this algorithm should help you out.
divide 30 by 12:
30=2*12+6 <-- and add the remainder
then divide 12 by 6: