if int32(i)%int32(p) == 0 {

/**
 * @param {number} n >= 3
 * @returns {number} Max prime number.
 */
const getMaxPrime = (n) => {
  if (n < 3) {
    throw new Error('n must be equal to or more than 3.')
  }
  let primes = [2]
  for (let i = 3; i <= n; i += 2) {
    const maxModCheck = Math.floor(Math.sqrt(i))
    for (let j = 0; j < primes.length; j++) {
      let p = primes[j]
      if (i % p == 0) {
        break;
      }
      if (p >= maxModCheck) {
        primes.push(i)
        break
      }
    }
  }
  return primes[primes.length - 1]
}

const startTime = (new Date()).getTime()
const maxPrime = getMaxPrime(10000000)
const endTime = (new Date()).getTime()
console.log(`Max Prime: ${maxPrime}`)
console.log(`Time: ${endTime - startTime}`)

package main

import (
  "fmt"
  "errors"
  "math"
  "time"
)


/**
 * @param n >= 3
 * @returns Max prime number.
 */
func getMaxPrime(n int) (error, int) {
  if (n < 3) {
    return errors.New("n must be equal to or more than 3."), 0
  }
  primes := make([]int, n / 2)
  primes[0] = 2
  numPrimes := 1
  for i := 3; i <= n; i += 2 {
    maxModCheck := int(math.Sqrt(float64(i)))
    for j := 0; j < numPrimes; j++ {
      p := primes[j]
      if i % p == 0 {
        break;
      }
      if p >= maxModCheck {
        primes[numPrimes] = i
        numPrimes += 1
        break
      }
    }
  }
  return nil, primes[numPrimes - 1]
}


func main() {
  startTime := time.Now().UnixNano() / 1000000
  err, maxPrime := getMaxPrime(10000000)
  if err == nil {
    fmt.Println("Max Prime: ", maxPrime)
    endTime := time.Now().UnixNano() / 1000000
    fmt.Println("Time: ", endTime - startTime)
  } else {
    fmt.Println(err)
    return
  }
}