import fractions values = [(1, 3), (2, 4), (2, 7)] for n, d in values: f = fractions.Fraction(n, d) print(f)import fractions print(fractions.Fraction(1.5)) print(fractions.Fraction(5)) print(fractions.Fraction(1,3))from fractions import Fraction frac = Fraction(1, 2)#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)