Rust - Nth Prime Complete

rust/nth-prime/Cargo.toml

@@ -0,0 +1,6 @@
+[package]
+name = "nth_prime"
+version = "1.0.0"
+authors = ["sacherjj <sacherjj@gmail.com>"]
+
+[dependencies]

rust/nth-prime/README.md

@@ -0,0 +1,47 @@
+# 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.
+
+## Rust Installation
+
+Refer to the [exercism help page][help-page] for Rust installation and learning
+resources.
+
+## Writing the Code
+
+Execute the tests with:
+
+```bash
+$ cargo test
+```
+
+All but the first test have been ignored.  After you get the first test to
+pass, remove the ignore flag (`#[ignore]`) from the next test and get the tests
+to pass again.  The test file is located in the `tests` directory.   You can
+also remove the ignore flag from all the tests to get them to run all at once
+if you wish.
+
+Make sure to read the [Crates and Modules](https://doc.rust-lang.org/stable/book/crates-and-modules.html) chapter if you
+haven't already, it will help you with organizing your files.
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/rust](https://github.com/exercism/rust) repository on GitHub is the home for all of the Rust exercises. If you have feedback about an exercise, or want to help implement new exercises, head over there and create an issue. Members of the [rust track team](https://github.com/orgs/exercism/teams/rust) are happy to help!
+
+If you want to know more about Exercism, take a look at the [contribution guide](https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md).
+
+[help-page]: http://exercism.io/languages/rust
+[crates-and-modules]: http://doc.rust-lang.org/stable/book/crates-and-modules.html
+
+## 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.

rust/nth-prime/src/lib.rs

@@ -0,0 +1,26 @@
+pub fn nth(arg: u64) -> Result<u64, u64> {
+    if arg <= 0 {
+        return Err(0);
+    }
+
+    let mut count = 0;
+    let mut prime = 1;
+
+    while count < arg {
+        prime += 1;
+        if is_prime(prime) {
+            count += 1
+        }
+    }
+
+    return Ok(prime);
+}
+
+pub fn is_prime(inp_int: u64) -> bool {
+    for i in 2..(((inp_int as f64).sqrt() as u64) + 1) {
+        if inp_int % i == 0 {
+            return false;
+        }
+    }
+    return true;
+}

rust/nth-prime/tests/nth-prime.rs

@@ -0,0 +1,26 @@
+extern crate nth_prime as np;
+
+#[test]
+fn test_first_prime() {
+    assert_eq!(np::nth(1), Ok(2));
+}
+
+#[test]
+fn test_second_prime() {
+    assert_eq!(np::nth(2), Ok(3));
+}
+
+#[test]
+fn test_sixth_prime() {
+    assert_eq!(np::nth(6), Ok(13));
+}
+
+#[test]
+fn test_big_prime() {
+    assert_eq!(np::nth(10001), Ok(104743));
+}
+
+#[test]
+fn test_zeroth_prime() {
+    assert!(np::nth(0).is_err());
+}