summaryrefslogtreecommitdiff
path: root/go/nth-prime/README.md
diff options
context:
space:
mode:
Diffstat (limited to 'go/nth-prime/README.md')
-rw-r--r--go/nth-prime/README.md27
1 files changed, 27 insertions, 0 deletions
diff --git a/go/nth-prime/README.md b/go/nth-prime/README.md
new file mode 100644
index 0000000..c485307
--- /dev/null
+++ b/go/nth-prime/README.md
@@ -0,0 +1,27 @@
+# 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](http://exercism.io/languages/go).
+
+## Source
+
+A variation on Problem 7 at Project Euler [http://projecteuler.net/problem=7](http://projecteuler.net/problem=7)
+
+## Submitting Incomplete Problems
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+