Sha256: 97895200a9b8e77123a8c7e0b83e5f344e408cc6987a1d85d6618e9d06f2d2b0
Contents?: true
Size: 569 Bytes
Versions: 365
Compression:
Stored size: 569 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. ## 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
365 entries across 184 versions & 1 rubygems