Sha256: 618d92a507bca2b2a86b472b22beb6aab8a354380a4d28777aba386b79a19f0f
Contents?: true
Size: 1.01 KB
Versions: 56
Compression:
Stored size: 1.01 KB
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. ### Submitting Exercises Note that, when trying to submit an exercise, make sure the solution is in the `exercism/python/<exerciseName>` directory. For example, if you're submitting `bob.py` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/python/bob/bob.py`. For more detailed information about running tests, code style and linting, please see the [help page](http://exercism.io/languages/python). ## 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
56 entries across 56 versions & 1 rubygems