A number theory problem by Christopher Boo

I have 2 positive integers. The greatest number that can divide both these numbers is 10, while the smallest positive number that is divisible by both is 100.

What is the product of these 2 integers?

1000 100 100000 10000

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

Áron Bán-Szabó
Jun 10, 2017

Let x x , y y are the two numbers. We know that gcd ( x , y ) = 10 \text{gcd}(x, y)=10 and lcm ( x , y ) = 100 \text{lcm}(x, y)=100 . We will use one of the relationships between GCD and LCM: x y lcm ( x , y ) = gcd ( x , y ) \frac{xy}{\text{lcm}(x, y)}=\text{gcd}(x, y) . From that we get x y 100 = 10 \frac{xy}{100}=10 , so x y = 10 100 = 1000 xy=10*100=\boxed{1000} .

We can check the solution with x = 20 x=20 and y = 50 y=50 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...