-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
cd6a9c5
commit 9435d43
Showing
3 changed files
with
11 additions
and
11 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,13 +1,13 @@ | ||
/** | ||
Check failure on line 1 in javascript/p0001.js GitHub Actions / javascript-lint
|
||
* Project Euler Problem 1 | ||
* | ||
* | ||
* Did this the old fashioned way, because this was before I figured out the closed form solution | ||
* | ||
* | ||
* Problem: | ||
* | ||
* | ||
* 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. | ||
*/ | ||
exports.p0001 = function() { | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,15 +1,15 @@ | ||
/** | ||
Check failure on line 1 in javascript/p0002.js GitHub Actions / javascript-lint
|
||
* Project Euler Problem 2 | ||
* | ||
* | ||
* Moved the fibonacci optimization to javascript | ||
* | ||
* | ||
* Problem: | ||
* | ||
* | ||
* 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. | ||
**/ | ||
|