Sha256: 92dd86696701595616a5d7252303ba55e5df2cb124ad6997a86de4ca7adceaf5
Contents?: true
Size: 845 Bytes
Versions: 107
Compression:
Stored size: 845 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.
## Making the Test Suite Pass
1. Get [PHPUnit].
% wget --no-check-certificate https://phar.phpunit.de/phpunit.phar
% chmod +x phpunit.phar
2. Execute the tests for an assignment.
% phpunit.phar wordy/wordy_test.php
[PHPUnit]: http://phpunit.de
## 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
107 entries across 107 versions & 1 rubygems