Sha256: 27158532742431214ef567513ee32adbf707c8401573d846ff63ba376a2ceaa4
Contents?: true
Size: 979 Bytes
Versions: 174
Compression:
Stored size: 979 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 setup instructions for PL/SQL to get ready to code: http://exercism.io/languages/plsql ## Running the Tests Execute the tests by calling the `run` method in the respective `ut_<exercise>#` package. The necessary code should be contained at the end of the test package. As an example, the test for the _hamming_ exercise would be run using ``` begin ut_hamming#.run; end; / ``` ## 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
174 entries across 174 versions & 1 rubygems