Python Program for GCD of more than two (or array) 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 for GCD of more than two (or array) numbers

kartik

Improve

Article Tags :

Python

Practice Tags :

python

Similar Reads

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 # GCD of more than two (or array) numbe

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 minimum sum of factors of number

Given a number, find minimum sum of its factors.Examples: Input : 12Output : 7Explanation: Following are different ways to factorize 12 andsum of factors in different ways.12 = 12 * 1 = 12 + 1 = 1312 = 2 * 6 = 2 + 6 = 812 = 3 * 4 = 3 + 4 = 712 = 2 * 2 * 3 = 2 + 2 + 3 = 7Therefore minimum sum is 7Inp

Python Program for Number of elements with odd factors in given range

Given a range [n,m], find the number of elements that have odd number of factors in the given range (n and m inclusive). Examples: Input : n = 5, m = 100 Output : 8 The numbers with odd factors are 9, 16, 25, 36, 49, 64, 81 and 100 Input : n = 8, m = 65 Output : 6 Input : n = 10, m = 23500 Output :

Python Program for Efficient program to print all prime factors of a given number

Given a number n, write an efficient function to print all prime factors of n. For example, if the input number is 12, then output should be "2 2 3". And if the input number is 315, then output should be "3 3 5 7". Following are the steps to find all prime factors. 1) While n is divisible by 2, prin

Python | sympy.divisor_count() method

With the help of sympy.divisor_count() method, we can count the number of divisors of the given integer. Syntax: divisor_count(n, modulus=1) Parameter: n - It denotes an integer. modulus - It is set to 1 by default. If modulus is not 1 then only those that are divisible by modulus are counted. Retur

Python | sympy.divisors() method

With the help of sympy.divisors() method, we can find all the divisors of a given number in sorted order by default. Syntax: divisors(n, generator=False) Parameter: n - It denotes an integer. generator - If generator is True an unordered generator object is returned, otherwise it returns a sorted li

numpy.floor_divide() in Python

numpy.floor_divide(arr1, arr2, /, out = None, where = True, casting = 'same_kind', order = 'K', dtype = None) : Array element from first array is divided by the elements from second array(all happens element-wise). Both arr1 and arr2 must have same shape. It is equivalent to the Python // operator a

Python Program for Basic Euclidean algorithms

Python3 # Python program to demonstrate Basic Euclidean Algorithm # Function to return gcd of a and b def gcd(a, b): if a == 0 : return b return gcd(b%a, a) a = 10 b = 15 print("gcd(", a , "," , b, ") = ", gcd(a, b)) a = 35 b = 10 print("gcd(", a , ",

Python | sympy.antidivisor_count() method

With the help of sympy.antidivisor_count() method, we can find the count of anti-divisors of a given integer. Syntax: antidivisor_count(n) Parameter: n - It denotes an integer. Returns: Returns the count of anti-divisors of the given integer. Example #1: Python3 # import antidivisor_count() method f