Problem 2: Even Fibonacci numbers

斐波那契数列之和

最新推荐文章于 2025-09-12 15:58:40 发布

转载最新推荐文章于 2025-09-12 15:58:40 发布 · 98 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Quxiaolong2020/p/7903893.html

文章标签：

#python

本文介绍了一个使用Python解决的问题：计算斐波那契数列中不超过四百万的所有偶数值项的总和。通过迭代的方式生成斐波那契数列，并检查每个数是否为偶数来累加符合条件的项。

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.

#斐波那契数列，python有个简易写法
s = 0  # 求和
a, b = 1, 1  # 赋初始值
n = 4000000  # 最大数
while True:
    a, b = b, a+b 
    if b >= n:
        break
    if b % 2 == 0:  # 满足偶数项条件
        s += b
print(s)