Question

How to calculate the Nth prime number in Kotlin

Answer 1

// 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73

fun isPrime(num: Int): Boolean {
    if (num <= 1) return false
    for (i in 2..Math.sqrt(num.toDouble()).toInt()) {
        if (num % i == 0) return false
    }
    return true
}

fun getTheNthPrimeNumber(n: Int): Int {
    var count = 0
    var num = 1
    while (count < n) {
        num++
        if (isPrime(num)) {
            count++
        }
    }
    return num
}

fun main() {
    val n = 9 
    
    println("Nth prime: ${getTheNthPrimeNumber(n)}")
}


 
 
/*
run:

Nth prime: 23
 
*/

 

70+ SQL courses for beginners and professionals