def gcd(a,b):
if a < b:
temp = b
b = a
a = temp
remainder = a % b
if remainder == 0:
return b
else:
return gcd(remainder,b)
def lcm(a,b):
remainder = gcd(a,b)
result = a*b/remainder
result2 = str(result)
print(str(a) + '和' + str(b) + '的最小公倍数是:' + str(a*b/remainder) )
lcm(6,9)