Jack Mustacato f03cebdf48 Update version file 2.0.0 -> 2.1.0 | 6 лет назад | |
---|---|---|
.. | ||
.meta | 6 лет назад | |
src | 7 лет назад | |
README.md | 7 лет назад | |
build.gradle | 7 лет назад |
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.
You can run all the tests for an exercise by entering
$ gradle test
in your terminal.
A variation on Problem 7 at Project Euler http://projecteuler.net/problem=7
It's possible to submit an incomplete solution so you can see how others have completed the exercise.