solution to problem 2 of euler project

ep2.m

function y=ep2(n)
%exhaustive method 
a=1;
b=2;
y=2;

c=a+b;
a=b;
b=c;
while c<=n,
    if mod(c,2)==0,
        y=y+c;
    end
    c=a+b;
    a=b;
    b=c;
end
end