Nth Prime [Exercism - Nim]

n.prime.nim

import std/math

proc isPrime(number: int): bool=
  let squareRoot = int(sqrt(float(number)))  
  for i in 2..squareRoot+1:
    if number mod i == 0: return false  
  return true


proc prime*(n: int): int = 
  if n < 1: raise newException(ValueError, "Invalid input")
  if n == 1: return 2
  var 
    primeCount = 0
    primeNumber = 1

  while primeCount < n:
   if isPrime(primeNumber):
     result = primeNumber
     inc(primeCount)
   inc(primeNumber)