-
-
Notifications
You must be signed in to change notification settings - Fork 5.7k
Project Euler 021 #1191
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
pomkarnath98
wants to merge
19
commits into
TheAlgorithms:master
from
pomkarnath98:project-euler-021
Open
Project Euler 021 #1191
Changes from 12 commits
Commits
Show all changes
19 commits
Select commit
Hold shift + click to select a range
b7309f0
📦 NEW: Added solution for ProjectEuler-007
omkarnathparida d3a3b33
🐛 FIX: Spelling mistake fixes
omkarnathparida e9b5a6a
👌 IMPROVE: changed variable name from `inc` to `candidateValue` and t...
omkarnathparida e99c722
👌 IMPROVE: Modified the code
omkarnathparida 5ac898f
Merge branch 'TheAlgorithms:master' into master
pomkarnath98 0f9f1ba
👌 IMPROVE: Added test case for ProjectEuler Problem001
omkarnathparida b06c09b
📦 NEW: Added solution for Project Euler-021
omkarnathparida 959b0b6
Updated Documentation in README.md
3caad5c
Merge branch 'TheAlgorithms:master' into master
pomkarnath98 9412130
Merge branch 'master' into project-euler-021
omkarnathparida 35ecee1
Updated Documentation in README.md
b7584fd
Merge branch 'TheAlgorithms:master' into master
pomkarnath98 6693f9c
Merge branch 'TheAlgorithms:master' into master
pomkarnath98 d6eb962
🐛 FIX: Some fixes
omkarnathparida 0830570
Merge branch 'TheAlgorithms:master' into master
pomkarnath98 4017f55
📦 NEW: Added solution for Project Euler-021
omkarnathparida a33da9a
Updated Documentation in README.md
7fd38e6
🐛 FIX: Some fixes
omkarnathparida 3d0f962
Merge branch 'project-euler-021' of https://github.com/pomkarnath98/J...
omkarnathparida File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or 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 hidden or 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 |
|---|---|---|
| @@ -0,0 +1,35 @@ | ||
| /** | ||
| * Amicable numbers | ||
| * | ||
| * P.S.(Project Euler - 021): | ||
| * Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). | ||
| * If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers. | ||
| * | ||
| * For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; | ||
| * therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220. | ||
| * | ||
| * Evaluate the sum of all the amicable numbers under 10000. | ||
| * | ||
| * @param {Number} maxNum | ||
| * @returns {Number} Sum of all amicable numbers under maxNum | ||
| */ | ||
| export const sumAmicableNums = (maxNum) => { | ||
| const amicNums = [] | ||
|
|
||
| for (let i = 1; i < maxNum; i++) { | ||
| const left = d(i) | ||
| const right = d(left) | ||
| if (i === right && i !== left && amicNums.indexOf(i) === -1) { | ||
| amicNums.push(i, left) | ||
| } | ||
| } | ||
| return amicNums.reduce((a, b) => a + b, 0) | ||
| } | ||
|
|
||
| const d = (num) => { | ||
| const output = [] | ||
| for (let i = 1; i < num; i++) { | ||
| if (num % i === 0) { output.push(i) } | ||
| } | ||
| return output.reduce((a, b) => a + b, 0) | ||
| } |
This file contains hidden or 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 |
|---|---|---|
| @@ -0,0 +1,8 @@ | ||
| import { sumAmicableNums } from '../Problem021.js' | ||
|
|
||
| describe('Amicable numbers', () => { | ||
| // Project Euler Condition Check | ||
| test('if the limit is 10000', () => { | ||
| expect(sumAmicableNums(10000)).toBe(31626) | ||
| }) | ||
| }) |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.