Python Program to Find LCM of Two Numbers

Python Program for Common Divisors of Two Numbers

Last Updated : 12 Jul, 2022

Given two integer numbers, the task is to find the count of all common divisors of given numbers?

Input : a = 12, b = 24
Output: 6
Explanation: all common divisors are 1, 2, 3, 4, 6 and 12
Input : a = 3, b = 17
Output: 1
Explanation: all common divisors are 1
Input : a = 20, b = 36
Output: 3
Explanation: all common divisors are 1, 2, 4

Python

# Python Program to find 
# Common Divisors of Two Numbers
 
a = 12
b = 24
n = 0
 
for i in range(1, min(a, b)+1):
    if a%i==b%i==0:
        n+=1
     
print(n)
 
# Code contributed by Mohit Gupta_OMG

Output

Time Complexity: O(min(a, b)), Where a and b is the given number.
Auxiliary Space: O(1)

Please refer complete article on Common Divisors of Two Numbers for more details!

Python Program to Find LCM of Two Numbers

kartik

News

Improve

Article Tags :

Python Programs

Similar Reads

Python Program for Common Divisors of Two Numbers

Given two integer numbers, the task is to find the count of all common divisors of given numbers? Input : a = 12, b = 24Output: 6Explanation: all common divisors are 1, 2, 3, 4, 6 and 12Input : a = 3, b = 17Output: 1Explanation: all common divisors are 1Input : a = 20, b = 36Output: 3Explanation: al

Python Program to Find LCM of Two Numbers

We are given two numbers and our task is to find the LCM of two numbers in Python. In this article, we'll discuss different approaches to finding the LCM of two numbers in Python. Example: Input: a = 12, b = 15Output: 60Explanation: LCM of 12 and 15 is 60Python Program to Find LCM of Two NumbersBelo

Python Program to Find the Gcd of Two Numbers

The task of finding the GCD (Greatest Common Divisor) of two numbers in Python involves determining the largest number that divides both input values without leaving a remainder. For example, if a = 60 and b = 48, the GCD is 12, as 12 is the largest number that divides both 60 and 48 evenly. Using e

Python Program for GCD of more than two (or array) numbers

The GCD of three or more numbers equals the product of the prime factors common to all the numbers, but it can also be calculated by repeatedly taking the GCDs of pairs of numbers. gcd(a, b, c) = gcd(a, gcd(b, c)) = gcd(gcd(a, b), c) = gcd(gcd(a, c), b) Python Code # GCD of more than two (or array)

Python Program to Find Numbers Divisible by Another Number

We are given a list of numbers and a number. We have to find all the numbers in the list that are divisible by the given single number. Examples: Input: list=[8, 14, 21, 36, 43], num=3Output: 21, 36, 57Input: list=[2, 17, 25, 31, 48, 55], num=5Output: 25, 55In this article, we will discuss the diffe

Python Program for Find sum of even factors of a number

Given a number n, the task is to find the even factor sum of a number. Examples: Input : 30 Output : 48 Even dividers sum 2 + 6 + 10 + 30 = 48 Input : 18 Output : 26 Even dividers sum 2 + 6 + 18 = 26 Let p1, p2, â€¦ pk be prime factors of n. Let a1, a2, .. ak be highest powers of p1, p2, .. pk respect

Python Program for Check if count of divisors is even or odd

Write a Python program for a given number â€œnâ€, the task is to find its total number of divisors that are even or odd. Examples: Input : n = 10 Output: Even Input: n = 100Output: Odd Input: n = 125Output: Even Python Program for Check if count of divisors is even or odd using Naive Approach:A naive a

Python Program for Find sum of odd factors of a number

Given a number n, the task is to find the odd factor sum. Examples: Input : n = 30 Output : 24 Odd dividers sum 1 + 3 + 5 + 15 = 24 Input : 18 Output : 13 Odd dividers sum 1 + 3 + 9 = 13 Let p1, p2, ... pk be prime factors of n. Let a1, a2, .. ak be highest powers of p1, p2, .. pk respectively that

Python Program for Check if all digits of a number divide it

Given a number n, find whether all digits of n divide it or not. Examples: Input : 128Output : Yes128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0. Input : 130Output : No We want to test whether each digit is non-zero and divides the number. For example, with 128, we want to test d != 0 && 128 %

Python Program for Smallest K digit number divisible by X

Integers X and K are given. The task is to find smallest K-digit number divisible by X. Examples: Input : X = 83, K = 5 Output : 10043 10040 is the smallest 5 digit number that is multiple of 83. Input : X = 5, K = 2 Output : 10 An efficient solution would be : Compute MIN : smallest K-digit number