#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. proc problem2 {} { set term 2 set term-1 1 set sum 0 while {$term <= 4000000} { if {($term % 2) == 0} { incr sum $term } set tmp ${term-1} set term-1 $term set term [expr $term + $tmp] } return $sum } # solution-2: 4613732

## Sunday, April 10, 2011

### Project Euler - Problem 2 - Tcl

Labels:
CS,
General,
math,
Problems,
Programming,
Project Euler,
TCL

Subscribe to:
Post Comments (Atom)

## No comments:

## Post a Comment