Finding divisors of the HCF of n numbers
for ( let i = 1 ; i * i <= g ; i ++ ) { if ( g % i == 0 ) { divisors . add ( i ) ; if ( Math . floor ( g / i ) != i ) divisors . add ( Math . floor ( g / i ) ) ; } }