Sha256: f1c22bd38454b7e806cb7b680a871562d885e4e264123a528d49510e900670ba
Contents?: true
Size: 573 Bytes
Versions: 165
Compression:
Stored size: 573 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
165 entries across 165 versions & 1 rubygems