Codility: CountFactors Solution

Approach

If number

is a divisor of , then is also a divisor.

One of these two divisors is less than or equal to

.

This could be proven by contradictory. Assume if that were not the case,

would be a product of two numbers greater than , which is impossible.

Implementation

1function solution(N) {
2  let result = 0
3  let i = 1
4  while (i * i < N) {
5    if (N % i === 0) {
6      result += 2
7    }
8    i++
9  }
10  if (i * i === N) {
11    result++
12  }
13
14  return result
15}