(a)
| 182 | } |
| 183 | |
| 184 | function smallestDivisor(a) { |
| 185 | var A = getFactors(a); |
| 186 | var result = a; |
| 187 | for(var i = 0; i < shortPrimes.length; i++) { |
| 188 | if(A[i] > 0) { |
| 189 | result = shortPrimes[i]; |
| 190 | break; |
| 191 | } |
| 192 | } |
| 193 | return result; |
| 194 | } |
| 195 | |
| 196 | function leastCommonMultiple(a, b) { |
| 197 | if(a < 1 || b < 1) return undefined; |
no test coverage detected
searching dependent graphs…