snapshot for sieve

rust/nth-prime/README.md

@@ -0,0 +1,42 @@
+# Nth Prime
+
+Welcome to Nth Prime on Exercism's Rust 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.
+
+Remember that while people commonly count with 1-based indexing (i.e. "the 6th prime is 13"), many programming languages, including Rust, use 0-based indexing (i.e. `primes[5] == 13`). Use 0-based indexing for your implementation.
+
+## Source
+
+### Created by
+
+- @sacherjj
+
+### Contributed to by
+
+- @attilahorvath
+- @cbzehner
+- @coriolinus
+- @cwhakes
+- @eddyp
+- @efx
+- @ErikSchierboom
+- @imbolc
+- @lutostag
+- @nfiles
+- @petertseng
+- @rofrol
+- @stringparser
+- @xakon
+- @ZapAnton
+
+### Based on
+
+A variation on Problem 7 at Project Euler - https://projecteuler.net/problem=7