Sha256: 9c39f859bf70372c37083627563c732ac872ec51596d59e2280e81de13350f6f
Contents?: true
Size: 1.22 KB
Versions: 75
Compression:
Stored size: 1.22 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. ## Setup There are two different methods of getting set up to run the tests with Objective-C: - Create an Xcode project with a test target which will run the tests. - Use the ruby gem `objc` as a test runner utility. Both are described in more detail here: http://exercism.io/languages/objective-c ### Submitting Exercises When submitting an exercise, make sure your solution file is in the same directory as the test code. The submit command will look something like: ```shell exercism submit <path-to-exercism-workspace>/objective-c/nth-prime/NthPrime.m ``` You can find the Exercism workspace by running `exercism debug` and looking for the line beginning with Workspace. ## 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
75 entries across 75 versions & 1 rubygems