Python fraction simplify

How to simplify fraction in python

def gcd(a,b):
	if a == 0:
		return b
	if b == 0:
		return a
	if a == b:
		return a
	if a > b:
		return gcd(a-b, b)
	return gcd(a, b-a)

def simplifyFraction(a, b):
  divisor = gcd(a, b)
  return (a / divisor, b / divisor)

Source: grepper.com

Python simplify fraction

#From scratch

#Euclid's algorithm https://en.wikipedia.org/wiki/Greatest_common_divisor#Euclid's_algorithm
def gcd(a: int, b: int):
    fraction = (a, b)
    while fraction[0] != fraction[1]:
        maximum = max(fraction)
        minimum = max(fraction)
        fraction = (maximum - minimum, minimum)
    return fraction[0]

def simplify(a: int, b: int):
  divisor = gcd(a, b)
  return (a / divisor, b / divisor)

-1

Source: grepper.com

Similar codes

6 votes147 views5 answers
12 hour clock to 24 hour clock in python
Python
0 vote154 views1 answer
Seaborn plot to see outliers
Python
291 votes1.4K views10 answers
Remove element from list python
Python
118 votes152 views6 answers
Python download
Python
4 votes158 views2 answers
Print prime numbers from 1 to 100 in python in single line
Python
1 vote135 views1 answer
Localhost postgres settings django
Python
0 vote163 views1 answer
How to loop through pages of pdf using python
Python
0 vote167 views1 answer
What does 0 for in array mean python
Python
0 vote178 views1 answer
Django.db.utils.ProgrammingError: can't adapt type 'dict_keys'
Python Django
0 vote155 views1 answer
Install easygui
Python