Sha256: 808b64dc7de30b6c8c364da49018d01106476d5b3b0f74366650d44d5e4456ac
Contents?: true
Size: 717 Bytes
Versions: 53
Compression:
Stored size: 717 Bytes
Contents
# Nth Prime 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: ```sh $ gradle test ``` For more detailed info about the Java track see the [help page](http://exercism.io/languages/java). ## Source A variation on Problem 7 at Project Euler [http://projecteuler.net/problem=7](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.
Version data entries
53 entries across 53 versions & 1 rubygems