Project Euler: Problem 2

By | 17. April 2013

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.

int x = 0;
int y = 1;
int limit = 4000000;
int result = 0;
int temp;
while (y<limit) {
	temp = x + y;
	x = y;
	y = temp;
	if (y%2==0) {
		result += y;
	}
}
System.out.println(result);

Lösung: 4613732

Project Euler: Problem 1

By | 17. April 2013

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.

int result = 0;
for (int i=0; i<1000; i++) {
	if (i%3==0 || i%5==0) {
		result += i;
	}
}
System.out.println(result);

Lösung: 233168