code: func checkSmallPrimes(i *big.Int) bool {
  	smallPrimesSingleton.Do(func() {
  		for _, prime := range smallPrimeInts {
  			smallPrimes = append(smallPrimes, big.NewInt(prime))
  		}
  	})
  
  	for _, prime := range smallPrimes {
  		var result big.Int
  		result.Mod(i, prime)
  		if result.Sign() == 0 {
  			return true
  		}
  	}
  
  	return false
  }
docs: // Returns true iff integer i is divisible by any of the primes in smallPrimes.
  //
  // Short circuits; execution time is dependent on i. Do not use this on secret
  // values.