Euler Problem 2 – Even Fibonacci numbers

Even Fibonacci numbers

Problem 2

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.

Assign the first two digits of Fibonacci sequence to 1 and 2 respectively and keep on generating new Fibonacci number by adding previous two. Check if the new Fibonacci number exceeds 4 million, if it does sum only the even valued numbers.

len  4000000) {
    print(sum(fibvals[fibvals %% 2 == 0 ]))
    break
  }
}
# [1] 4613732
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s