History

Brian Buller ec45e6b2eb Updating all of the new ones that are done.		2016-09-02 14:26:22 -05:00
..
nth_prime_test.go	Syncing	2016-08-29 22:24:05 -05:00
nth_prime.go	Updating all of the new ones that are done.	2016-09-02 14:26:22 -05:00
README.md	Syncing	2016-08-29 22:24:05 -05:00

Nth Prime

Write a program that can tell you 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.

To run the tests simply run the command go test in the exercise directory.

If the test suite contains benchmarks, you can run these with the -bench flag:

go test -bench .

For more detailed info about the Go track see the help page.

Source

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

It's possible to submit an incomplete solution so you can see how others have completed the exercise.