Python: Find common divisors between two numbers in a given pair
Python Basic - 1: Exercise-29 with Solution
Write a Python program to find common divisors between two numbers in a given pair.
def ngcd(x, y): i=1 while(i<=x and i<=y): if(x%i==0 and y%i == 0): gcd=i; i+=1 return gcd; def num_comm_div(x, y): n = ngcd(x, y) result = 0 z = int(n**0.5) i = 1 while( i <= z ): if(n % i == 0): result += 2 if(i == n/i): result-=1 i+=1 return result print("Number of common divisors: ",num_comm_div(2, 4)) print("Number of common divisors: ",num_comm_div(2, 8)) print("Number of common divisors: ",num_comm_div(12, 24))
Number of common divisors: 2 Number of common divisors: 2 Number of common divisors: 6
Visualize Python code execution:
The following tool visualize what the computer is doing step-by-step as it executes the said program:
Python Code Editor:
Have another way to solve this solution? Contribute your code (and comments) through Disqus.
Previous: Write a Python program to print the length of the series and the series from the given 3rd term , 3rd last term and the sum of a series.
Next: Write a Python program to reverse the digits of a given number and add it to the original, If the sum is not a palindrome repeat this procedure.
What is the difficulty level of this exercise?
- New Content published on w3resource :
- Python Numpy exercises
- Python GeoPy Package exercises
- Python Pandas exercises
- Python nltk exercises
- Python BeautifulSoup exercises
- Form Template
- Composer - PHP Package Manager
- PHPUnit - PHP Testing
- Laravel - PHP Framework