# 递归算法 实现m(n)=1/2+2/3+…+n/n+1 的计算
def factorial(n):
if n == 1:
return 1 / 2
else:
return (n / (n + 1) + factorial(n - 1))
print(factorial(20))
# for循环 实现m(n)=1/2+2/3+…+n/n+1 的计算
def caculate(n):
sum = 0
for m in range(0, n + 1):
sum = sum + m / (m + 1)
print(f'sum={sum}')
caculate(20)