最小公倍数：两个或多个整数公有的倍数叫做它们的公倍数，其中除0以外最小的一个公倍数就叫做这几个整数的最小公倍数
二者关系：两个数之积=最小公倍数*最大公约数
方法1：辗转相除法
a=int(input(‘please enter 1st num:‘))
b=int(input(‘please enter 2nd num:‘))
s=a*b
while a%b!=0:
a,b=b,(a%b)
else:
print(b,‘is the maximum common divisor‘)
print(s//b,‘is the least common multiple‘)
#运行结果
please enter 1st num:10
please enter 2nd num:15
5 is the Maximum common divisor
30 is the Least common multiple
方法2：更相减损法
a=int(input(‘please enter 1st num:‘))
b=int(input(‘please enter 2nd num:‘))
s=a*b
while a!=b:
if a>b:
a-=b
elif a<b:
b-=a
else:
print(a,‘is the maximum common divisor‘)
print(s//a,‘is the least common multiple‘)
#运行结果
please enter 1st num:40
please enter 2nd num:60
20 is the maximum common divisor
120 is the least common multiple
原文：https://www.cnblogs.com/USTC-ZCC/p/12611434.html