project_euler.problem_002.sol4

Project Euler Problem 2: https://projecteuler.net/problem=2

Even Fibonacci Numbers

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.

References:

Functions

solution(→ int)

Returns the sum of all even fibonacci sequence elements that are lower

Module Contents

project_euler.problem_002.sol4.solution(n: int = 4000000) → int

Returns the sum of all even fibonacci sequence elements that are lower or equal to n.

>>> solution(10)
10
>>> solution(15)
10
>>> solution(2)
2
>>> solution(1)
0
>>> solution(34)
44
>>> solution(3.4)
2
>>> solution(0)
Traceback (most recent call last):
    ...
ValueError: Parameter n must be greater than or equal to one.
>>> solution(-17)
Traceback (most recent call last):
    ...
ValueError: Parameter n must be greater than or equal to one.
>>> solution([])
Traceback (most recent call last):
    ...
TypeError: Parameter n must be int or castable to int.
>>> solution("asd")
Traceback (most recent call last):
    ...
TypeError: Parameter n must be int or castable to int.