Add docs for new rust solutions

docs/rust/p0003.rst

@@ -1,15 +1,18 @@
-Rust Implementation of Problem 4
+Rust Implementation of Problem 3
 ================================
 
-View source code `here on GitHub! <https://github.com/LivInTheLookingGlass/Euler/blob/master/rust/src/p0004.rs>`_
+View source code `here on GitHub! <https://github.com/LivInTheLookingGlass/Euler/blob/master/rust/src/p0003.rs>`_
+
+Includes
+--------
+
+- `primes <./primes.html>`_
 
 Problem Solution
 ----------------
 
-.. rust:fn:: p0004::is_palindrome(x: u64) -> bool
-
-.. rust:fn:: p0004::p0004() -> u64
+.. rust:fn:: p0003::p0003() -> u64
 
-.. literalinclude:: ../../rust/src/p0004.rs
+.. literalinclude:: ../../rust/src/p0003.rs
    :language: rust
    :linenos:

docs/rust/p0004.rst

@@ -0,0 +1,15 @@
+Rust Implementation of Problem 4
+================================
+
+View source code `here on GitHub! <https://github.com/LivInTheLookingGlass/Euler/blob/master/rust/src/p0004.rs>`_
+
+Problem Solution
+----------------
+
+.. rust:fn:: p0004::is_palindrome(x: u64) -> bool
+
+.. rust:fn:: p0004::p0004() -> u64
+
+.. literalinclude:: ../../rust/src/p0004.rs
+   :language: rust
+   :linenos:

docs/rust/p0005.rst

@@ -0,0 +1,13 @@
+Rust Implementation of Problem 5
+================================
+
+View source code `here on GitHub! <https://github.com/LivInTheLookingGlass/Euler/blob/master/rust/src/p0005.rs>`_
+
+Problem Solution
+----------------
+
+.. rust:fn:: p0005::p0005() -> u64
+
+.. literalinclude:: ../../rust/src/p0005.rs
+   :language: rust
+   :linenos:

docs/rust/p0006.rst

@@ -0,0 +1,13 @@
+Rust Implementation of Problem 6
+================================
+
+View source code `here on GitHub! <https://github.com/LivInTheLookingGlass/Euler/blob/master/rust/src/p0006.rs>`_
+
+Problem Solution
+----------------
+
+.. rust:fn:: p0006::p0006() -> u64
+
+.. literalinclude:: ../../rust/src/p0006.rs
+   :language: rust
+   :linenos:

rust/src/p0005.rs

@@ -1,3 +1,18 @@
+/*
+Project Euler Problem 5
+
+I solved this problem by testing all combinations of the various multiples. I
+actually tried to solve this by hand before doing this, and it wasn't terribly
+hard. The answer turns out to be (2**4 * 3**2 * 5 * 7 * 11 * 13 * 17 * 19)
+
+Problem:
+
+2520 is the smallest number that can be divided by each of the numbers from 1
+to 10 without any remainder.
+
+What is the smallest positive number that is evenly divisible by all of the
+numbers from 1 to 20?
+*/
 use itertools::Itertools;
 
 pub fn p0005() -> u64 {