Microsoft Small Basic

Sum of Fibonacci members

Modified: 2008/12/24 01:19 by admin - Categorized as: Samples
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, ...

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


a = 1
b = 2
sum = 0

maxValue = 4000000

While (a < maxValue)
  If (Math.Remainder(a, 2) = 0) Then
    sum = sum + a
  EndIf
  temp = a
  a = b
  b = b + temp
EndWhile

TextWindow.WriteLine("Sum = " + sum)

ScrewTurn Wiki version 2.0.35. Some of the icons created by FamFamFam.