🎉 Exercism Research is now launched. Help Exercism, help science and have some fun at research.exercism.io 🎉
Avatar of marcusschroeder

marcusschroeder's solution

to Nth Prime in the Kotlin Track

Published at Dec 09 2020 · 0 comments
Test suite

Given a number n, determine what the nth prime is.

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.

If your language provides methods in the standard library to deal with prime numbers, pretend they don't exist and implement them yourself.


Go through the setup instructions for Kotlin to install the necessary dependencies:


Making the test suite pass

Execute the tests with:

$ gradlew test

Use gradlew.bat if you're on Windows

In the test suites all tests but the first have been skipped.

Once you get a test passing, you can enable the next one by removing the @Ignore annotation.


A variation on Problem 7 at Project Euler http://projecteuler.net/problem=7

Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.


import org.junit.Test
import org.junit.Ignore
import org.junit.Rule
import org.junit.rules.ExpectedException
import kotlin.test.assertEquals

class PrimeTest {

    var expectedException: ExpectedException = ExpectedException.none()

    fun firstPrime() {
        assertEquals(2, Prime.nth(1))

    fun secondPrime() {
        assertEquals(3, Prime.nth(2))

    fun sixthPrime() {
        assertEquals(13, Prime.nth(6))

    fun bigPrime() {
        assertEquals(104743, Prime.nth(10001))

    fun undefinedPrime() {
        expectedException.expectMessage("There is no zeroth prime.")


import kotlin.math.sqrt

object Prime {

    // optimized for performance
    // All Test Cases -> total time: 50 ms
    // 20x Test Case "bigPrime" (n = 10001) -> total time: ~200 ms
    fun nth(n: Int): Int {
        require(n != 0) { "There is no zeroth prime." }
        var prime = 2
        var counter = 1
        var next = 3

        while (counter < n) {
            // skipping even numbers
            if ((3..next.sqrt() step 2).any { next % it == 0 }.not()) {
                prime = next
            next += 2

        return prime

    private fun Int.sqrt() = sqrt(this.toDouble()).toInt()

Community comments

Find this solution interesting? Ask the author a question to learn more.

What can you learn from this solution?

A huge amount can be learned from reading other people’s code. This is why we wanted to give exercism users the option of making their solutions public.

Here are some questions to help you reflect on this solution and learn the most from it.

  • What compromises have been made?
  • Are there new concepts here that you could read more about to improve your understanding?