problem 2

Problem 2

19 October 2001

Each new term in the Fibonaccisequence is generated by adding the previous two terms. By starting with 1 and2, the first 10 terms will be:

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

Find the sum of all theeven-valued terms in the sequence which do not exceed four million.

Mathematica:

Clear[i,j,k];
For[i=1,i<1000,i++,
 If[Fibonacci[i]>4000000,Break[]]
 ];
s=0;
For[j=3,j<i,j+=3,
 s+=Fibonacci[j];
 ];
Print[s];


2009311星期三,再次精简代码

i=3;s=0;
While[Fibonacci[i]<4*10^6,s+=Fibonacci[i];i+=3]//Timing
s

{0.016,Null}

4613732
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值