aboutsummaryrefslogtreecommitdiff
path: root/challenge-109/abigail/node/ch-1.js
diff options
context:
space:
mode:
authorAbigail <abigail@abigail.be>2021-04-20 20:52:57 +0200
committerAbigail <abigail@abigail.be>2021-04-20 20:52:57 +0200
commit7b4fbbe6505b63d2faa62ad34939b6e830ea692b (patch)
tree971934b1ed31b67a5dbb0b1f83148079e36bc58a /challenge-109/abigail/node/ch-1.js
parent490b2215c7eaeb037b7548564306e2081784b3e4 (diff)
downloadperlweeklychallenge-club-7b4fbbe6505b63d2faa62ad34939b6e830ea692b.tar.gz
perlweeklychallenge-club-7b4fbbe6505b63d2faa62ad34939b6e830ea692b.tar.bz2
perlweeklychallenge-club-7b4fbbe6505b63d2faa62ad34939b6e830ea692b.zip
When looping over possible divisors, stop at n / 2.
Diffstat (limited to 'challenge-109/abigail/node/ch-1.js')
-rw-r--r--challenge-109/abigail/node/ch-1.js2
1 files changed, 1 insertions, 1 deletions
diff --git a/challenge-109/abigail/node/ch-1.js b/challenge-109/abigail/node/ch-1.js
index d7cff7b0f5..0f75cf4962 100644
--- a/challenge-109/abigail/node/ch-1.js
+++ b/challenge-109/abigail/node/ch-1.js
@@ -15,7 +15,7 @@ let COUNT = 20
function divisor_sum (n) {
let sum = 0
- for (let i = 2; i < n; i ++) {
+ for (let i = 2; i <= Math . floor (n / 2); i ++) {
if (n % i == 0) {
sum += i
}