Function ladderz::pre_algebra::get_factor_pairs
source · pub fn get_factor_pairs(n: u32) -> HashSet<(u32, u32)>Expand description
Finds all factor pairs for a positive integer n.
This function calculates and returns a HashSet<(u32, u32)> containing all unique factor pairs
-of the input positive integer n. A factor pair is a pair of positive integers
+
Function ladderz::pre_algebra::get_factor_pairs
source · pub fn get_factor_pairs(n: u32) -> HashSet<(u32, u32)>Expand description
Finds all factor pairs for a positive integer n.
A factor pair is a pair of positive integers
(a, b) where a and b are both factors of n (i.e., a * b == n).
This function calculates and returns a HashSet<(u32, u32)> containing all unique factor pairs
+of the input positive integer n.
Examples
use std::collections::HashSet;
use ladderz::pre_algebra::get_factor_pairs;
diff --git a/ladderz/pre_algebra/fn.get_factors.html b/ladderz/pre_algebra/fn.get_factors.html
index 6b7b991..8d26e99 100644
--- a/ladderz/pre_algebra/fn.get_factors.html
+++ b/ladderz/pre_algebra/fn.get_factors.html
@@ -1,7 +1,8 @@
-get_factors in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::get_factors
source · pub fn get_factors(n: u32) -> HashSet<u32>
Expand description
Finds all factors of a positive integer n.
-This function calculates and returns a HashSet<u32> containing all unique factors
-of the input positive integer n. A factor of n is a positive integer a where
+
get_factors in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::get_factors
source · pub fn get_factors(n: u32) -> HashSet<u32>
Expand description
Finds all factors of a positive integer n.
+A factor of n is a positive integer a where
n is evenly divisible by a (i.e., n % a == 0).
+This function calculates and returns a HashSet<u32> containing all unique factors
+of the input positive integer n.
Examples
use std::collections::HashSet;
use ladderz::pre_algebra::get_factors;
diff --git a/ladderz/pre_algebra/fn.get_multiples_in_range.html b/ladderz/pre_algebra/fn.get_multiples_in_range.html
index 0f083ad..144a18f 100644
--- a/ladderz/pre_algebra/fn.get_multiples_in_range.html
+++ b/ladderz/pre_algebra/fn.get_multiples_in_range.html
@@ -1,4 +1,4 @@
-get_multiples_in_range in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::get_multiples_in_range
source · pub fn get_multiples_in_range(n: u32, end: u32) -> HashSet<u32>
Expand description
Finds all the multiples of a positive integer n up to and including end (in the range [n, end]).
+get_multiples_in_range in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::get_multiples_in_range
source · pub fn get_multiples_in_range(n: u32, end: u32) -> HashSet<u32>
Expand description
Finds all the multiples of a positive integer n up to and including end (in the range [n, end]).
Returns a HashSet<u32> containing all the multiples of a positive integer n in the range [n, end].
A multiple of n is a positive integer num where num is evenly divisible by n (i.e., num % n == 0).
Examples
diff --git a/ladderz/pre_algebra/fn.is_factor.html b/ladderz/pre_algebra/fn.is_factor.html
index b33b699..62dfe3f 100644
--- a/ladderz/pre_algebra/fn.is_factor.html
+++ b/ladderz/pre_algebra/fn.is_factor.html
@@ -1,4 +1,4 @@
-is_factor in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_factor
source · pub fn is_factor(x: u32, y: u32) -> bool
Expand description
Checks if a positive integer x is a factor of another positive integer y.
+is_factor in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_factor
source · pub fn is_factor(x: u32, y: u32) -> bool
Expand description
Checks if a positive integer x is a factor of another positive integer y.
A factor of y is a positive integer x where y is evenly divisible by x (i.e., y % x == 0).
Examples
use ladderz::pre_algebra::is_factor;
diff --git a/ladderz/pre_algebra/fn.is_multiple.html b/ladderz/pre_algebra/fn.is_multiple.html
index 59a89b7..f47683d 100644
--- a/ladderz/pre_algebra/fn.is_multiple.html
+++ b/ladderz/pre_algebra/fn.is_multiple.html
@@ -1,4 +1,4 @@
-is_multiple in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_multiple
source · pub fn is_multiple(x: u32, y: u32) -> bool
Expand description
Checks if a positive integer x is a multiple of another positive integer y.
+is_multiple in ladderz::pre_algebra - Rust Function ladderz::pre_algebra::is_multiple
source · pub fn is_multiple(x: u32, y: u32) -> bool
Expand description
Checks if a positive integer x is a multiple of another positive integer y.
A multiple of y is a positive integer x where x is evenly divisible by y (i.e., x % y == 0).
Examples
use ladderz::pre_algebra::is_multiple;
diff --git a/src/ladderz/pre_algebra/unit1.rs.html b/src/ladderz/pre_algebra/unit1.rs.html
index 2a832c8..851f526 100644
--- a/src/ladderz/pre_algebra/unit1.rs.html
+++ b/src/ladderz/pre_algebra/unit1.rs.html
@@ -209,13 +209,19 @@
209
210
211
+212
+213
+214
+215
use std::collections::HashSet;
/// Finds all factor pairs for a positive integer `n`.
///
-/// This function calculates and returns a `HashSet<(u32, u32)>` containing all unique factor pairs
-/// of the input positive integer `n`. A factor pair is a pair of positive integers
+/// A factor pair is a pair of positive integers
/// `(a, b)` where `a` and `b` are both factors of `n` (i.e., `a * b == n`).
+///
+/// This function calculates and returns a `HashSet<(u32, u32)>` containing all unique factor pairs
+/// of the input positive integer `n`.
///
/// # Examples
///
@@ -253,10 +259,12 @@
}
/// Finds all factors of a positive integer `n`.
+///
+/// A factor of `n` is a positive integer `a` where
+/// `n` is evenly divisible by `a` (i.e., `n % a == 0`).
///
/// This function calculates and returns a `HashSet<u32>` containing all unique factors
-/// of the input positive integer `n`. A factor of `n` is a positive integer `a` where
-/// `n` is evenly divisible by `a` (i.e., `n % a == 0`).
+/// of the input positive integer `n`.
///
/// # Examples
///