A number theory problem by Christopher Boo

True or False?

x x and y y are two positive integers.
If gcd ( x , y ) = x , \text{gcd}{(x, y)} = x, then lcm ( x , y ) = y . \text{lcm}{(x, y)} = y.


Notations: gcd ( ) \gcd(\cdot) and lcm ( ) \text{lcm}(\cdot) denote the greatest common divisor function and the lowest common multiple function, respectively.

True False

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.

1 solution

Tapas Mazumdar
Jun 10, 2017

If gcd ( x , y ) = x \gcd (x,y) = x then it means that y y can be represented as n x nx for some positive integer n n . So, y y is an integer multiple of x x and since lcm ( x , n x ) = n x \text{lcm} (x,nx) = nx , so we get lcm ( x , y ) = y \text{lcm} (x,y) = y .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...