Loop to find the divisors of the given number upto SQRT ( N )
for ( let i = 3 ; i <= Math . floor ( Math . sqrt ( x ) ) ; i += 2 ) { count = 0 ; while ( x % i == 0 ) { count ++ ; x = Math . floor ( x / i ) ; } if ( count != 0 ) v . push ( count ) ; }