feat: Added implementation for factors

README.md

@@ -57,6 +57,7 @@ These are for demonstration purposes only.
 - [x] [Chinese Remainder Theorem](./src/math/chinese_remainder_theorem.rs)
 - [x] [Extended euclidean algorithm](./src/math/extended_euclidean_algorithm.rs)
 - [x] [Fast Inverse Square Root 'Quake' Algorithm](./src/math/square_root.rs)
+- [x] [Factors](./src/math/factors.rs)
 - [x] [Gaussian Elimination](./src/math/gaussian_elimination.rs)
 - [x] [Greatest common divisor](./src/math/greatest_common_divisor.rs)
 - [x] [Greatest common divisor of n numbers](./src/math/gcd_of_n_numbers.rs)

src/math/factors.rs

@@ -0,0 +1,46 @@
+/// Factors are natural numbers which can divide a given natural number to give a remainder of zero
+/// Hence 1, 2, 3 and 6 are all factors of 6, as they divide the number 6 completely,
+/// leaving no remainder.
+/// This function is to list out all the factors of a given number 'n'
+
+pub fn factors(number: u64) -> Vec<u64> {
+    let mut factors: Vec<u64> = Vec::new();
+
+    for i in 1..((number as f64).sqrt() as u64 + 1) {
+        if number % i == 0 {
+            factors.push(i);
+            if i != number / i {
+                factors.push(number / i);
+            }
+        }
+    }
+
+    factors.sort();
+    factors
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn prime_number() {
+        assert_eq!(vec![1, 59], factors(59));
+    }
+
+    #[test]
+    fn highly_composite_number() {
+        assert_eq!(
+            vec![
+                1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 30, 36, 40, 45, 60, 72, 90, 120,
+                180, 360
+            ],
+            factors(360)
+        );
+    }
+
+    #[test]
+    fn composite_number() {
+        assert_eq!(vec![1, 3, 23, 69], factors(69));
+    }
+}

src/math/mod.rs

@@ -7,6 +7,7 @@ mod chinese_remainder_theorem;
 mod collatz_sequence;
 mod doomsday;
 mod extended_euclidean_algorithm;
+mod factors;
 mod fast_fourier_transform;
 mod fast_power;
 mod faster_perfect_numbers;
@@ -46,6 +47,7 @@ pub use self::chinese_remainder_theorem::chinese_remainder_theorem;
 pub use self::collatz_sequence::sequence;
 pub use self::doomsday::get_week_day;
 pub use self::extended_euclidean_algorithm::extended_euclidean_algorithm;
+pub use self::factors::factors;
 pub use self::fast_fourier_transform::{
     fast_fourier_transform, fast_fourier_transform_input_permutation,
     inverse_fast_fourier_transform,