diff --git a/ladderz/all.html b/ladderz/all.html index f0107e1..48b2d15 100644 --- a/ladderz/all.html +++ b/ladderz/all.html @@ -1 +1 @@ -List of all items in this crate

List of all items

Functions

\ No newline at end of file +List of all items in this crate

List of all items

Functions

\ No newline at end of file diff --git a/ladderz/pre_algebra/fn.is_prime.html b/ladderz/pre_algebra/fn.is_prime.html new file mode 100644 index 0000000..b1e493c --- /dev/null +++ b/ladderz/pre_algebra/fn.is_prime.html @@ -0,0 +1,14 @@ +is_prime in ladderz::pre_algebra - Rust

Function ladderz::pre_algebra::is_prime

source · 
pub fn is_prime(n: u32) -> bool
Expand description

Checks if a positive integer n is a prime number.

+

A prime number is a positive integer greater than 1 that cannot +be evenly divisible by any positive integers other than 1 and itself.

+

Examples

+
use ladderz::pre_algebra::is_prime;
+
+assert!(!is_prime(1)); // 1 is not a prime number
+assert!(is_prime(2)); // 2 is a prime number
+assert!(!is_prime(4)); // 4 is not a prime number
+assert!(is_prime(7)); // 7 is a prime number
+

Note

+

This function returns false for values of n less than 2 because, by definition, prime +numbers must be greater than 1.

+
\ No newline at end of file diff --git a/ladderz/pre_algebra/index.html b/ladderz/pre_algebra/index.html index dd0f961..46c4cd3 100644 --- a/ladderz/pre_algebra/index.html +++ b/ladderz/pre_algebra/index.html @@ -5,4 +5,4 @@ let x: u32 = 10; println!("The factors of {x} are {:?}.", get_factors(x)); 
The factors of 10 are {1, 5, 2, 10}.
-

Functions

\ No newline at end of file +

Functions

\ No newline at end of file diff --git a/ladderz/pre_algebra/sidebar-items.js b/ladderz/pre_algebra/sidebar-items.js index a5fdfbb..c47e697 100644 --- a/ladderz/pre_algebra/sidebar-items.js +++ b/ladderz/pre_algebra/sidebar-items.js @@ -1 +1 @@ -window.SIDEBAR_ITEMS = {"fn":["get_factor_pairs","get_factors","get_multiples_in_range","is_factor","is_multiple"]}; \ No newline at end of file +window.SIDEBAR_ITEMS = {"fn":["get_factor_pairs","get_factors","get_multiples_in_range","is_factor","is_multiple","is_prime"]}; \ No newline at end of file diff --git a/ladderz/pre_algebra/unit1/fn.is_prime.html b/ladderz/pre_algebra/unit1/fn.is_prime.html new file mode 100644 index 0000000..98d0ff3 --- /dev/null +++ b/ladderz/pre_algebra/unit1/fn.is_prime.html @@ -0,0 +1,11 @@ + + + + + Redirection + + +

Redirecting to ../../../ladderz/pre_algebra/fn.is_prime.html...

+ + + \ No newline at end of file diff --git a/search-index.js b/search-index.js index 85f1e6c..dca17d1 100644 --- a/search-index.js +++ b/search-index.js @@ -1,5 +1,5 @@ var searchIndex = JSON.parse('{\ -"ladderz":{"doc":"ladderz","t":"AFFFFF","n":["pre_algebra","get_factor_pairs","get_factors","get_multiples_in_range","is_factor","is_multiple"],"q":[[0,"ladderz"],[1,"ladderz::pre_algebra"]],"d":["Various pre-algebra implementations including factor …","Finds all factor pairs for a positive integer n.","Finds all factors of a positive integer n.","Finds all the multiples of a positive integer n up to and …","Checks if a positive integer x is a factor of another …","Checks if a positive integer x is a multiple of another …"],"i":[0,0,0,0,0,0],"f":[0,[1,2],[1,[[2,[1]]]],[[1,1],[[2,[1]]]],[[1,1],3],[[1,1],3]],"c":[],"p":[[15,"u32"],[3,"HashSet"],[15,"bool"]]}\ +"ladderz":{"doc":"ladderz","t":"AFFFFFF","n":["pre_algebra","get_factor_pairs","get_factors","get_multiples_in_range","is_factor","is_multiple","is_prime"],"q":[[0,"ladderz"],[1,"ladderz::pre_algebra"]],"d":["Various pre-algebra implementations including factor …","Finds all factor pairs for a positive integer n.","Finds all factors of a positive integer n.","Finds all the multiples of a positive integer n up to and …","Checks if a positive integer x is a factor of another …","Checks if a positive integer x is a multiple of another …","Checks if a positive integer n is a prime number."],"i":[0,0,0,0,0,0,0],"f":[0,[1,2],[1,[[2,[1]]]],[[1,1],[[2,[1]]]],[[1,1],3],[[1,1],3],[1,3]],"c":[],"p":[[15,"u32"],[3,"HashSet"],[15,"bool"]]}\ }'); if (typeof window !== 'undefined' && window.initSearch) {window.initSearch(searchIndex)}; if (typeof exports !== 'undefined') {exports.searchIndex = searchIndex}; diff --git a/src/ladderz/pre_algebra/unit1.rs.html b/src/ladderz/pre_algebra/unit1.rs.html index 832092f..8286428 100644 --- a/src/ladderz/pre_algebra/unit1.rs.html +++ b/src/ladderz/pre_algebra/unit1.rs.html @@ -200,6 +200,38 @@ 200 201 202 +203 +204 +205 +206 +207 +208 +209 +210 +211 +212 +213 +214 +215 +216 +217 +218 +219 +220 +221 +222 +223 +224 +225 +226 +227 +228 +229 +230 +231 +232 +233 +234 
use std::collections::HashSet;
 
 /// Finds all factor pairs for a positive integer `n`.
@@ -338,6 +370,38 @@
     multiples
 }
 
+/// Checks if a positive integer `n` is a prime number.
+///
+/// A prime number is a positive integer greater than 1 that cannot
+/// be evenly divisible by any positive integers other than 1 and itself.
+///
+/// # Examples
+///
+/// ```rust
+/// use ladderz::pre_algebra::is_prime;
+///
+/// assert!(!is_prime(1)); // 1 is not a prime number
+/// assert!(is_prime(2)); // 2 is a prime number
+/// assert!(!is_prime(4)); // 4 is not a prime number
+/// assert!(is_prime(7)); // 7 is a prime number
+/// ```
+///
+/// # Note
+///
+/// This function returns `false` for values of `n` less than 2 because, by definition, prime
+/// numbers must be greater than 1.
+pub fn is_prime(n: u32) -> bool {
+    if n == 1 {
+        return false;
+    };
+    for num in 2..n {
+        if n % num == 0 {
+            return false;
+        }
+    }
+    true
+}
+
 #[cfg(test)]
 mod tests {
     use super::*;