2024年Python最全使用python进行数学计算(分数运算及递归)

    return a + f(n - 1)
else:
    return 0

def g(n):
if n == 1:
return fractions.Fraction(1, 30)
elif n > 1:
divisor = 4 * (4 * n + 1) * (4 * n + 2)
a = fractions.Fraction(1, divisor)
return a + g(n - 1)
else:
return 0

F = f(2)
G = g(2)
print(“F={0}, \r\nG={1}, \r\nF+3-G={2}”.format(F, G, F+3-G))

F = f(2024)

G = g(2024)

print(“F={0}, \r\nG={1}, \r\nF+3-G={2}”.format(F, G, round(float(F+3-G), 2)))

F = f(2024)
G = g(2024)
print(“F={0}, \r\nG={1}, \r\nF+3-G={2}”.format(F, G, round(float(F+3-G), 2)))

sys.setrecursionlimit(default_recursion_limit)
print(sys.getrecursionlimit())

python中默认的递归次数限