# A*b = LCM(a,b)*HCF(a,b)

1. Jun 22, 2009

### Anonymus1984

Hello,

I have been searching in vain for a general proof of the following:

a*b = LCM(a,b)*HCF(a,b)

I go up to seeing the product of the two numbers as the product of their respective prime factors and that contains the HCF of the Two numbers. But, I'm unable to visualize the rest of the prime factors together becoming the LCM of the two numbers.... please help me...

Thank you.

2. Jun 22, 2009

### in3

If
$$a = p_1^{e_1} \cdot p_2^{e_2} \cdots p_n^{e_n}$$,

$$b = p_1^{f_1} \cdot p_2^{f_2} \cdots p_n^{f_n}$$,

where $$p_i$$ are unique prime numbers and $$e_i \ge 0, f_i \ge 0$$, then

$$\text{hcf}(a,b) = p_1^{\min(e_1,f_1)} \cdots p_n^{\min(e_n, f_n)}$$,

$$\text{lcm}(a,b) = p_1^{\max(e_1,f_1)} \cdots p_n^{\max(e_n, f_n)}$$.

So what's $$\text{hcf}(a,b) \cdot \text{lcm}(a,b)$$?

3. Jun 24, 2009

### Anonymus1984

Hello in3,

Thanks for the reply. But, I still don't understand... I'm just a beginner.

Not all the Ps would be in the lcm(a,b) or the hcf(a,b) right? we take only the ones that are common.. right?

Also, I don't understand the representation of lcm and hcf... can you please send me a link where I can get a more detailed explanation of the representation?

Thank you.

4. Jun 24, 2009

### in3

$$p_1, \ldots, p_n$$ are all the prime factors from both a and b. Note that if $$p_k$$ is a prime factor in a but not in b, then $$f_k$$ will be 0.

As for a link, I guess you could look at MathWorld, though I'm not sure it includes the details you seek. But I would encourage you to think about what hcf and lcm means and how it's reflected in the above.

5. Jun 24, 2009

### albert1993

$$hcf(a,b)$$ is going to be all the common factors of a and b right?
so if we make a and b in the form that in3 made, we find that they share some $$p_n$$'s, right? so whatever is smaller, thus $$min (e_n, f_n)$$, will become a common factor of a and b. if we multiply all of these we get $$hcf (a,b)$$

and there will be enough p's in the lcm and hcf when multiplied because you're taking the minimum of p's in hcf and the maximum of p's in lcm.

here's a quick example: 12 & 120

$$12=2^2*3$$
$$120=2^3*3*5$$
$$hcf(12,120)=2^{min(2,3)}*3^{min(1,1)}*5^{min(0,1)}=2^2*3^1*5^0=12$$
$$lcm(12,120)=2^{max(2,3)}*3^{max(1,1)}*5^{max(0,1)}=2^3*3^1*5^1=120$$
$$12*120=2^2*3*2^3*3*5=2^{2+3}*3^{1+1}*5{0+1}=2^5*3^2*5=1440=12*120=lcm(12,120)*hcf(12,120)$$

see that we added the exponents of each prime? that's multiplication of the two numbers a,b.
see that the minimum of the exponents and maximum of the exponents added together cover this up? that's hcf*lcm.

hope i helped :)

Last edited: Jun 24, 2009
6. Jun 24, 2009

### thrill3rnit3

Here's a pretty informal explanation, but you should be able to visualize it from here.

So we're trying to prove that lcm(a,b)*hcf(a,b)=a*b. Consider any prime $$p$$. It enters the factorization of $$a$$ as $$p^{e}$$ and of $$b$$ as $$p^{f}$$. Without loss of generality let's say that $$a \leq b$$. When we take the HCF of $$a$$ and $$b$$, we need $$e$$ number of $$p's$$, since any more factors of $$p$$ will not divide $$b$$. Similarly, when we take the LCM, we need $$f$$ number of $$p's$$, since $$f$$ factors of $$p$$ are required if $$b$$ is to divide the LCM. Thus, in the product of the HCF and LCM all factors of $$p$$ will come together as $$p^{e+f}$$. But this factor $$p^{e+f}$$ is the same power of $$p$$ which enters into the prime factorization of $$ab$$!. Since this argument applies to any prime $$p$$, the prime factorizations of lcm(a,b)*hcf(a,b) and $$ab$$ must be the same, so lcm(a,b)*hcf(a,b) and $$ab$$ must be equal. Q.E.D.

7. Jun 25, 2009

### Anonymus1984

I understand now... thank you in3, albert1993 and thrill3rnit3...

Once you understand something, it looks so simple and you wonder why you didn't get it all along... I guess that is the sign of understanding something...

Thank you very much.