Jamo

	/**	 * Find the sum of all the even-valued terms in the Fibonacci sequence	 * which do not exceed one million.	 */	public int solveProblem2() {				// start as if we already did #1		int sum = 1;		int lastNumber = 1;		int nextNumber = 2;		int currentNumber;		while (nextNumber < 1000000) {			currentNumber = nextNumber;			sum += currentNumber;			nextNumber = currentNumber + lastNumber;			lastNumber = currentNumber;		}		return sum;	}