diff options
author | elioat <hi@eli.li> | 2023-08-23 08:52:45 -0400 |
---|---|---|
committer | elioat <hi@eli.li> | 2023-08-23 08:52:45 -0400 |
commit | bafa7a87b32e21b7d769c08130c7c4de45b4dcc3 (patch) | |
tree | 5465e7a46399e90ebab3b12b978384b99661192d | |
parent | 562a9a52d599d9a05f871404050968a5fd282640 (diff) | |
download | tour-bafa7a87b32e21b7d769c08130c7c4de45b4dcc3.tar.gz |
*
-rw-r--r-- | js/algo/01_pe.js | 8 | ||||
-rw-r--r-- | js/algo/02_pe.js | 9 |
2 files changed, 17 insertions, 0 deletions
diff --git a/js/algo/01_pe.js b/js/algo/01_pe.js new file mode 100644 index 0000000..634d20e --- /dev/null +++ b/js/algo/01_pe.js @@ -0,0 +1,8 @@ +// https://projecteuler.net/problem=1 + +// <p>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$.</p> +// <p>Find the sum of all the multiples of $3$ or $5$ below $1000$.</p> + +const solution = Array.from({length: 1000}).reduce( + (p, n, i) => p + (i % 3 === 0 || i % 5 === 0 ? i : 0), 0 ) +console.log(solution) \ No newline at end of file diff --git a/js/algo/02_pe.js b/js/algo/02_pe.js new file mode 100644 index 0000000..51f91fd --- /dev/null +++ b/js/algo/02_pe.js @@ -0,0 +1,9 @@ +// https://projecteuler.net/problem=2 + +// <p>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, \dots$$</p> +// <p>By considering the terms in the Fibonacci sequence whose values do not exceed +// four million, find the sum of the even-valued terms.</p> + + |