Just playing with lcm and gcd

Let lcm ( a , b ) , a , gcd ( a , b ) \text{lcm }(a,b), \ a, \ \text{gcd }(a,b) form a geometric progression , where a a and b b are two positive integers , what is the relationship between a a and b b ?

Notations :

a < b a<b a = b a=b a > b a>b Cannot be determined

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Margaret Zheng
Jun 9, 2016

Let's try simplifying the expression l c m ( a , b ) × g c d ( a , b ) lcm(a,b) \times gcd(a,b) first to find b b , the square root of their product.

Say g c d ( a , b ) = c gcd(a,b)=c . We can write a a , b b as c × a c c \times \frac{a}{c} , c × b c c \times \frac{b}{c} . Thus, the least common multiple would be c × a c × b c c \times \frac{a}{c} \times \frac{b}{c} . Multiplying lcm and gcd together, we get c × a c × b c × c = a b . c \times \frac{a}{c} \times \frac{b}{c} \times c = ab.

Now we could see that b = a b b= \sqrt{ab} , which makes a = b a=b .

Pham Khanh
Jun 6, 2016

Relevant wiki: | Geometric Progression || gcd(a,b)*lcm(a,b)=ab | Cause l c m ( a , b ) , a , g c d ( a , b ) lcm(a,b), a, gcd(a,b) are in a geometric progression, l c m ( a , b ) = a r , a = g c d ( a , b ) r l c m ( a , b ) = a r , g c d ( a , b ) = a 1 r lcm(a,b)=a*r,a=gcd(a,b)*r \iff lcm(a,b)=a*r,gcd(a,b)=a*\frac{1}{r} with r r is the ratio.So a b = g c d ( a , b ) l c m ( a , b ) = a r a 1 r = a 2 ( r 1 r ) = a 2 ab=gcd(a,b)*lcm(a,b)=a*r*a*\frac{1}{r}=a^2*(r*\frac{1}{r})=a^2 a 2 = a b a = b ( cause a, b are positive integers ) \iff a^2=ab \iff \boxed{a=b}(\text{cause a, b are positive integers})

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...