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

0 vote47 views1 answer
New sytax in python 3
Python
1 vote47 views1 answer
Django model choice field from another model
Python
0 vote58 views1 answer
Quicksort in Python site:stackoverflow.com
Python
0 vote59 views1 answer
Neopixel thonny python
Python
-2 votes67 views6 answers
Django download
Python Django
0 vote48 views1 answer
Today's day of the year
Python
0 vote48 views1 answer
Python serial COM3
Python
41 votes50 views6 answers
Python try except
Python
2 votes50 views3 answers
How to get a number from a string in python
Python
11 votes55 views1 answer
How to upgrade 3.6 to 3.7 on linux
Python