Jun 21, 2022 · Jun 11, 2022 · Jun 12, 2022 · Jun 12, 2022 · Jun 12, 2022 · Jun 12, 2022
diff --git a/Lib/fractions.py b/Lib/fractions.py
                break
            p0, q0, p1, q1 = p1, q1, p0+a*p1, q2
            n, d = d, n-a*d

        k = (max_denominator-q0)//q1
        bound1 = Fraction(p0+k*p1, q0+k*q1, _normalize=False)
        bound2 = Fraction(p1, q1, _normalize=False)
        if abs(bound2 - self) <= abs(bound1-self):
            return bound2

        # Determine which of the candidate fractions (p0+k*p1)/(q0+k*q1) and
        # p1/q1 is closer to self. The distance between the two candidates is
        # 1/(q1*(q0+k*q1)), while the distance from p1/q1 to self is
        # 1/(q1*(q0+n/d*q1)). So we need to compare q0+k*q1 with 2*(q0+n/d*q1).
        # That translates to the following comparison in integers.
        if (q0+2*k*q1)*d <= q1*n:
            return Fraction(p1, q1, _normalize=False)
        else:
            returnbound1
            returnFraction(p0+k*p1, q0+k*q1, _normalize=False)

    @property
    def numerator(a):
Original file line number	Diff line number	Diff line change
Expand Up		@@ -245,14 +245,17 @@ def limit_denominator(self, max_denominator=1000000):
		break
		p0, q0, p1, q1 = p1, q1, p0+a*p1, q2
		n, d = d, n-a*d

		k = (max_denominator-q0)//q1
		bound1 = Fraction(p0+kp1, q0+kq1, _normalize=False)
		bound2 = Fraction(p1, q1, _normalize=False)
		if abs(bound2 - self) <= abs(bound1-self):
		return bound2

		# Determine which of the candidate fractions (p0+kp1)/(q0+kq1) and
		# p1/q1 is closer to self. The distance between the two candidates is
		# 1/(q1(q0+kq1)), while the distance from p1/q1 to self is
		# 1/(q1(q0+n/dq1)). So we need to compare q0+kq1 with 2(q0+n/d*q1).
		# That translates to the following comparison in integers.
		if (q0+2kq1)d <= q1n:
		return Fraction(p1, q1, _normalize=False)
		else:
		returnbound1
		returnFraction(p0+kp1, q0+kq1, _normalize=False)

		@property
		def numerator(a):
Expand Down