Python Program to find LCM

Posted in Python Tutorial

Updated on Nov 16, 2024

By Mari Selvan

👁️ 128 - Views

⏳ 4 mins

💬 1 Comment

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.

find_lcm.py

Copied

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.

Output

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!