Euler Problem 2

This one was incredibly straight forward again, so no real need to comment. Solution is provided below for any corrections or observations…

Euler 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, …

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.

Solution

int prev = 1;
        int now = 2;
        int temp = 0;
        int total = 0;
        
        while (prev < 4000000) {
            if ((now % 2) == 0) {
                total += now;
            }
            
            temp = now + prev;
            prev = now;
            now = temp;
        }
        
        System.out.println(“Total: ” + total);

Answer: 4613732

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s