Euler 002 ruby Solution

Problem

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.

Answer: 4613732

Solution

euler002.rb

#!/usr/bin/env ruby
def sum_even_fib(upper)
  fib1 = 1
  fib2 = 1
  result = 0
  summed = 0

  while result < upper
    summed += result if result.even?
    result = fib1 + fib2
    fib2 = fib1
    fib1 = result
  end
  summed
end

puts sum_even_fib(4_000_000) if __FILE__ == $PROGRAM_NAME

#	cpp	go	java	php	ruby	rust	javascript
1
2
3
4
5
6
7
8
9
10
11
12

#	cpp	ruby
13
14
15
16
17
18
19
20
21
22
23
24

Euler 002 ruby Solution

Problem

Solution

See Also