|
|
9 gadus atpakaļ | |
|---|---|---|
| .. | ||
| src | 9 gadus atpakaļ | |
| README.md | 9 gadus atpakaļ | |
| build.gradle | 9 gadus atpakaļ | |
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.
To run the tests:
$ gradle test
For more detailed info about the Java track see the help page.
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.