Problem 2 - Even Fibonacci numbers

本文通过Python代码实现,计算Fibonacci数列中不超过四百万的所有偶数之和。

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.

加和Fibonacci数列的偶数值。

Python
 1 fibonacci = [1,2]
 2 maximum = 4000000
 3 summary = 2
 4 
 5 while True:
 6     fibonacci.append(fibonacci[-2] + fibonacci[-1])
 7     if fibonacci[-1] > maximum:
 8         break
 9     if fibonacci[-1] % 2 == 0:
10         summary += fibonacci[-1]
11 
12 print summary

 

转载于:https://www.cnblogs.com/luchigster/archive/2013/01/05/2845331.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值