Python/maths/find_lcm.py

def find_lcm(num_1, num_2):
    max = num_1 if num_1 > num_2 else num_2
    lcm = max
    while (True):
        if ((lcm % num_1 == 0) and (lcm % num_2 == 0)):
            break
        lcm += max
    return lcm


def main():
    num_1 = 12
    num_2 = 76
    print(find_lcm(num_1, num_2))


if __name__ == '__main__':
    main()
Program for finding the HCF,LCM and Palindrome using and recursion and non recursion 2018-11-23 16:51:07 +00:00			`def find_lcm(num_1, num_2):`
			`max = num_1 if num_1 > num_2 else num_2`
Editing base64, Adding average file, Editing find_lcm (#673) * avrage.py calculate and print the avrage of number list. * Update base64_cipher.py encoding and decoding base64 without any module. * Update and rename avrage.py to average.py * update find_lcm algorithm I made find_lcm more efficient form O(num1*num2) to O(min{num1,num2}). 2019-01-19 20:49:06 +00:00			`lcm = max`
Program for finding the HCF,LCM and Palindrome using and recursion and non recursion 2018-11-23 16:51:07 +00:00			`while (True):`
Editing base64, Adding average file, Editing find_lcm (#673) * avrage.py calculate and print the avrage of number list. * Update base64_cipher.py encoding and decoding base64 without any module. * Update and rename avrage.py to average.py * update find_lcm algorithm I made find_lcm more efficient form O(num1*num2) to O(min{num1,num2}). 2019-01-19 20:49:06 +00:00			`if ((lcm % num_1 == 0) and (lcm % num_2 == 0)):`
Program for finding the HCF,LCM and Palindrome using and recursion and non recursion 2018-11-23 16:51:07 +00:00			`break`
Editing base64, Adding average file, Editing find_lcm (#673) * avrage.py calculate and print the avrage of number list. * Update base64_cipher.py encoding and decoding base64 without any module. * Update and rename avrage.py to average.py * update find_lcm algorithm I made find_lcm more efficient form O(num1*num2) to O(min{num1,num2}). 2019-01-19 20:49:06 +00:00			`lcm += max`
			`return lcm`
Program for finding the HCF,LCM and Palindrome using and recursion and non recursion 2018-11-23 16:51:07 +00:00

			`def main():`
			`num_1 = 12`
			`num_2 = 76`
			`print(find_lcm(num_1, num_2))`


			`if __name__ == '__main__':`
			`main()`