Sha256: 8908af772047f91060bc274d57137ef449f992f20618c291239eb50986d3ad90
Contents?: true
Size: 683 Bytes
Versions: 181
Compression:
Stored size: 683 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. ## Setup Go through the project setup instructions for Xcode using Swift: http://exercism.io/languages/swift ## 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
181 entries across 181 versions & 1 rubygems