// 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73
import Foundation
func isPrime(_ num: Int) -> Bool {
if num <= 1 { return false }
if num <= 3 { return true }
if num % 2 == 0 || num % 3 == 0 { return false }
var i = 5
while i * i <= num {
if num % i == 0 || num % (i + 2) == 0 { return false }
i += 6
}
return true
}
func getTheNthPrimeNumber(_ n: Int) -> Int {
var count = 0
var num = 1
while count < n {
num += 1
if isPrime(num) {
count += 1
}
}
return num
}
let n = 9
print("The \(n)th prime number is \(getTheNthPrimeNumber(n))")
/*
run:
The 9th prime number is 23
*/