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

avieira's solution

to Nth Prime in the Kotlin Track

Published at Jun 29 2020 · 0 comments
Instructions
Test suite
Solution

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.

Setup

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

https://exercism.io/tracks/kotlin/installation

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.

Source

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.

PrimeTest.kt

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

class PrimeTest {

    @Rule
    @JvmField
    var expectedException: ExpectedException = ExpectedException.none()

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

    @Ignore
    @Test
    fun secondPrime() {
        assertEquals(3, Prime.nth(2))
    }

    @Ignore
    @Test
    fun sixthPrime() {
        assertEquals(13, Prime.nth(6))
    }

    @Ignore
    @Test
    fun bigPrime() {
        assertEquals(104743, Prime.nth(10001))
    }

    @Ignore
    @Test
    fun undefinedPrime() {
        expectedException.expect(IllegalArgumentException::class.java)
        expectedException.expectMessage("There is no zeroth prime.")

        Prime.nth(0)
    }

}
object Prime {

    fun nth(n: Int): Int {
        if(n<1) throw IllegalArgumentException("There is no zeroth prime.")
        val primeNumbers = generateSequence(2) {
            var num = it
            do{
                num++
            }while((2 until num).any { intVal -> num % intVal == 0 })
            num
        }
        return primeNumbers.take(n).last()
    }
}

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?