# Nth Prime

Welcome to Nth Prime on Exercism's C Track.
If you need help running the tests or submitting your code, check out `HELP.md`.

## Instructions

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

### Created by

- @RealBarrettBrown

### Contributed to by

- @bcc32
- @Gamecock
- @gea-migration
- @h-3-0
- @patricksjackson
- @QLaille
- @ryanplusplus
- @wolf99

### Based on

A variation on Problem 7 at Project Euler - http://projecteuler.net/problem=7