2012-03-01 10:35:34 +00:00
|
|
|
title: By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
|
|
|
|
|
url: http://projecteuler.net/problem=2
|
|
|
|
|
|
|
|
|
|
desc: |
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
|
|
solution: |
|
|
|
|
|
Step through the fibonacci sequence while you sum each even entry. Quit as you reach 4million
|
|
|
|
|
|
|
|
|
|
solutions:
|
|
|
|
|
solve.php:
|
|
|
|
|
desc: Basic solution
|
|
|
|
|
language: php
|
|
|
|
|
solve.rb:
|
|
|
|
|
desc: Basic solution in Ruby
|
|
|
|
|
language: ruby
|
|
|
|
|
solve.c:
|
|
|
|
|
desc: ANSI C solution (Tested with TCC)
|
|
|
|
|
language: c
|
2011-04-11 09:38:22 +00:00
|
|
|
solve.js:
|
|
|
|
|
desc: NodeJS solution
|
2012-04-11 12:49:45 +00:00
|
|
|
language: javascript
|
|
|
|
|
solve.lua:
|
|
|
|
|
desc: Basic solution
|
|
|
|
|
language: lua
|
