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.

I am working on a project for my assembly language programming class and the prof has us writing a program to calculate fibonacci numbers but we need to make only 1 recursive call. Here is my ...