Python Basic
Python Interview Programs
- Python Interview Programs
- Python Abundant Number
- Python Amicable Number
- Python Armstrong Number
- Python Average of N Numbers
- Python Automorphic Number
- Python Biggest of three numbers
- Python Binary to Decimal
- Python Common Divisors
- Python Composite Number
- Python Condense a Number
- Python Cube Number
- Python Decimal to Binary
- Python Decimal to Octal
- Python Disarium Number
- Python Even Number
- Python Evil Number
- Python Factorial of a Number
- Python Fibonacci Series
- Python GCD
- Python Happy Number
- Python Harshad Number
- Python LCM
- Python Leap Year
- Python Magic Number
- Python Matrix Addition
- Python Matrix Division
- Python Matrix Multiplication
- Python Matrix Subtraction
- Python Matrix Transpose
- Python Maximum Value of an Array
- Python Minimum Value of an Array
- Python Multiplication Table
- Python Natural Number
- Python Number Combination
- Python Odd Number
- Python Palindrome Number
- Python Pascalβs Triangle
- Python Perfect Number
- Python Perfect Square
- Python Power of 2
- Python Power of 3
- Python Pronic Number
- Python Prime Factor
- Python Prime Number
- Python Smith Number
- Python Strong Number
- Python Sum of Array
- Python Sum of Digits
- Python Swap Two Numbers
- Python Triangular Number
Python Program to find LCM
Photo Credit to CodeToFun
π Introduction
In the domain of programming, solving mathematical problems is a common and necessary task. One such problem is finding the Least Common Multiple (LCM) of two numbers.
The LCM is the smallest positive integer that is divisible by both numbers without leaving a remainder.
In this tutorial, we'll explore a Python program that efficiently finds the LCM of two given numbers.
π Example
Let's take a look at the Python code that achieves this functionality.
def find_gcd(num1, num2):
while num2:
num1, num2 = num2, num1 % num2
return num1
def find_lcm(num1, num2):
# LCM = (num1 * num2) / GCD(num1, num2)
gcd = find_gcd(num1, num2)
return (num1 * num2) // gcd
# Driver program
if __name__ == "__main__":
# Replace these values with your desired numbers
number1 = 12
number2 = 18
# Call the function to find the LCM
lcm = find_lcm(number1, number2)
print(f"LCM of {number1} and {number2} is: {lcm}")
π» Testing the Program
To test the program with different numbers, replace the values of number1 and number2 in the if __name__ == "__main__": block.
LCM of 12 and 18 is: 36
Run the script to see the LCM in action.
π§ How the Program Works
- The program defines a function find_gcd to calculate the Greatest Common Divisor (GCD) of two numbers using the Euclidean algorithm.
- The function find_lcm uses the GCD to find the LCM using the relationship: LCM = (num1 * num2) / GCD(num1, num2).
- The driver program in the if __name__ == "__main__": block sets the values of number1 and number2, calls the find_lcm function, and prints the result.
π§ Understanding the Concept of LCM
Before delving into the code, let's take a moment to understand the concept of the Least Common Multiple (LCM).
The LCM of two numbers is the smallest positive integer that is divisible by both numbers without leaving a remainder.
For example, consider the numbers 12 and 18. The multiples of 12 are 12, 24, 36, 48, 60, 72, 84, 96, 108, 120, ... The multiples of 18 are 18, 36, 54, 72, 90, 108, 126, 144, 162, 180, ... The LCM of 12 and 18 is 36.
π’ Optimizing the Program
While the provided program is effective, there are more efficient algorithms for finding the LCM. Consider exploring and implementing optimized algorithms such as the prime factorization method.
Feel free to incorporate and modify this code as needed for your specific use case. Happy coding!
π¨βπ» Join our Community:
Author
For over eight years, I worked as a full-stack web developer. Now, I have chosen my profession as a full-time blogger at codetofun.com.
Buy me a coffee to make codetofun.com free for everyone.
Buy me a Coffee
If you have any doubts regarding this article (Python Program to find LCM), please comment here. I will help you immediately.