The greatest common divisor of two integers is x + 5 and their least common multiple is x(x + 5) , where x is a positive integer. If one of the integers is 60, what is the smallest possible value of the other one?

Guest Nov 1, 2020

#1**0 **

x=0;p=0; y=0;z=0;n=gcd(y, 60);m=lcm(y, 60);if(n==x+5 and m==x*(x+5), goto loop, goto next);loop:p=p+1;printp," =",x,y;next:x++;if(x<200, goto4,0);x=0;y++;if(y<200, goto4, 0)

**x = 15. Your two integers are: 60 and the smallest possible value of the 2nd integer = 100.**

**GCD[60, 100] =[x + 5] =[15 + 5] = 20**

**LCM[60,100] =x[x + 5] =15*[15 + 5] =15 * 20 =300**

Guest Nov 1, 2020