Simplify primality test

// 2 is a special case of prime, and if n < 2 then skip it. For others see bellow
if n > 2 {
  for i := 2; i <= i/2; i++ {
    if n % i == 0 {
       break
      //It's not a prime
    }
  }
  // It's a prime
}