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.

## Running the tests

To run the tests, run the command `busted .` from within the exercise directory.

## Further information

For more detailed information about the Lua track, including how to get help if
you're having trouble, please visit the exercism.io [Lua language page](http://exercism.io/languages/lua/about).

## 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

121 entries across 121 versions & 1 rubygems

Version	Path
trackler-2.2.0.2	tracks/lua/exercises/nth-prime/README.md