-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem-2.php
More file actions
40 lines (35 loc) · 784 Bytes
/
problem-2.php
File metadata and controls
40 lines (35 loc) · 784 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
<?php
declare(strict_types=1);
/**
* 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.
*
* @see https://projecteuler.net/problem=2
*
* @param int $limit
*
* @return int
*/
function problem2(int $limit = 4000000): int
{
$n1 = 1;
$n2 = 1;
$sum = 0;
while ($n2 < $limit) {
$tmp = $n1 + $n2;
$n1 = $n2;
$n2 = $tmp;
if ($n2 % 2 === 0) {
$sum += $n2;
}
}
return $sum;
}