Least common multiple (lcm) and Greatest common divisor (gcd) question: “Prove lcm(m,n) = m*n/gcd(m,n)?”
Answer It’s equivalent to proving m*n = (lcm(m,n) ) * ( gcd(m,n) ) Now, i’ll have to use basic number theory. The idea is to show that the number of times a prime factor of m*n occurs on the LHS is equal to the number of times a prime factor of (lcm(m,n) ) *...
STAY CONNECTED